./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77cd31699320cd40da64f32a92959020d19291bd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:01:15,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:01:15,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:01:15,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:01:15,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:01:15,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:01:15,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:01:15,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:01:15,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:01:15,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:01:15,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:01:15,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:01:15,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:01:15,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:01:15,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:01:15,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:01:15,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:01:15,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:01:15,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:01:15,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:01:15,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:01:15,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:01:15,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:01:15,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:01:15,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:01:15,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:01:15,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:01:15,852 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:01:15,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:01:15,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:01:15,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:01:15,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:01:15,854 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:01:15,854 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:01:15,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:01:15,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:01:15,856 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:01:15,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:01:15,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:01:15,867 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:01:15,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:01:15,867 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:01:15,868 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:01:15,868 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:01:15,868 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:01:15,868 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:01:15,868 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:01:15,868 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:01:15,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:01:15,869 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:01:15,870 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:01:15,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:01:15,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:01:15,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:01:15,871 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:01:15,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:01:15,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:01:15,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:01:15,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:01:15,872 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77cd31699320cd40da64f32a92959020d19291bd [2018-11-18 09:01:15,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:01:15,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:01:15,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:01:15,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:01:15,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:01:15,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-18 09:01:15,941 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/data/2b5e17911/5560944dca974483a8a57352b765e099/FLAG09d19ae21 [2018-11-18 09:01:16,331 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:01:16,331 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-18 09:01:16,335 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/data/2b5e17911/5560944dca974483a8a57352b765e099/FLAG09d19ae21 [2018-11-18 09:01:16,346 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/data/2b5e17911/5560944dca974483a8a57352b765e099 [2018-11-18 09:01:16,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:01:16,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:01:16,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:01:16,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:01:16,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:01:16,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2270e037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16, skipping insertion in model container [2018-11-18 09:01:16,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:01:16,374 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:01:16,491 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:01:16,493 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:01:16,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:01:16,519 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:01:16,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16 WrapperNode [2018-11-18 09:01:16,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:01:16,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:01:16,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:01:16,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:01:16,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:01:16,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:01:16,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:01:16,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:01:16,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... [2018-11-18 09:01:16,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:01:16,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:01:16,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:01:16,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:01:16,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:01:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:01:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:01:16,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:01:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:01:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:01:16,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:01:16,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:16 BoogieIcfgContainer [2018-11-18 09:01:16,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:01:16,830 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:01:16,830 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:01:16,833 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:01:16,834 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:01:16,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:01:16" (1/3) ... [2018-11-18 09:01:16,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a16cd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:01:16, skipping insertion in model container [2018-11-18 09:01:16,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:01:16,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:16" (2/3) ... [2018-11-18 09:01:16,836 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a16cd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:01:16, skipping insertion in model container [2018-11-18 09:01:16,836 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:01:16,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:16" (3/3) ... [2018-11-18 09:01:16,838 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-18 09:01:16,889 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:01:16,890 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:01:16,890 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:01:16,890 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:01:16,890 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:01:16,890 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:01:16,890 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:01:16,891 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:01:16,891 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:01:16,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 09:01:16,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-18 09:01:16,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:16,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:16,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:01:16,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:16,932 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:01:16,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-18 09:01:16,934 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-18 09:01:16,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:16,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:16,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:01:16,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:16,941 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 21#L21-4true [2018-11-18 09:01:16,941 INFO L796 eck$LassoCheckResult]: Loop: 21#L21-4true assume true; 29#L21-1true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 23#L21-3true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 21#L21-4true [2018-11-18 09:01:16,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:01:16,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:16,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 09:01:17,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 09:01:17,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,207 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:17,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:17,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:17,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:17,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:17,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:17,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:17,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:17,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 09:01:17,209 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:17,209 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:17,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:17,514 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:17,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:17,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:17,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:17,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:17,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:17,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:17,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:17,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:17,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:17,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:17,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:17,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:17,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:17,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:17,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:17,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:17,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:17,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:17,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:17,631 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 09:01:17,631 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:01:17,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:17,634 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:17,635 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:17,635 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1, ULTIMATE.start_main_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 09:01:17,659 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 09:01:17,669 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:17,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:17,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:17,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:17,724 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 [2018-11-18 09:01:17,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 4 states. [2018-11-18 09:01:17,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 4 states. Result 60 states and 88 transitions. Complement of second has 8 states. [2018-11-18 09:01:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:01:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-18 09:01:17,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 09:01:17,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:17,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 09:01:17,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:17,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 09:01:17,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:17,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 88 transitions. [2018-11-18 09:01:17,781 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:17,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 25 states and 34 transitions. [2018-11-18 09:01:17,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 09:01:17,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 09:01:17,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-18 09:01:17,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:17,785 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 09:01:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-18 09:01:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 09:01:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 09:01:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-18 09:01:17,804 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 09:01:17,804 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-18 09:01:17,804 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:01:17,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2018-11-18 09:01:17,805 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:17,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:17,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:17,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:01:17,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:17,806 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 151#L21-4 assume true; 153#L21-1 assume !(main_~i~0 < 5); 148#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 149#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 165#L25-4 [2018-11-18 09:01:17,806 INFO L796 eck$LassoCheckResult]: Loop: 165#L25-4 assume true; 166#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 169#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 165#L25-4 [2018-11-18 09:01:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 889538667, now seen corresponding path program 1 times [2018-11-18 09:01:17,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:17,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:01:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:01:17,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:17,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-11-18 09:01:17,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:01:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:01:17,891 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-18 09:01:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:17,910 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-18 09:01:17,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:01:17,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-18 09:01:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:17,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-11-18 09:01:17,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 09:01:17,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 09:01:17,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-18 09:01:17,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:17,914 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 09:01:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-18 09:01:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-18 09:01:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 09:01:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-18 09:01:17,916 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-18 09:01:17,916 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-18 09:01:17,916 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:01:17,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-18 09:01:17,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:17,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:17,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:17,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:17,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:17,918 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 229#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 215#L21-4 assume true; 216#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 221#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 217#L21-4 assume true; 218#L21-1 assume !(main_~i~0 < 5); 212#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 213#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 230#L25-4 assume true; 231#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 234#L25-3 [2018-11-18 09:01:17,918 INFO L796 eck$LassoCheckResult]: Loop: 234#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 235#L25-4 assume true; 236#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 234#L25-3 [2018-11-18 09:01:17,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1694430990, now seen corresponding path program 1 times [2018-11-18 09:01:17,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:17,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:17,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:17,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:17,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 09:01:17,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:17,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:17,977 INFO L82 PathProgramCache]: Analyzing trace with hash 62341, now seen corresponding path program 2 times [2018-11-18 09:01:17,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:17,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:17,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:01:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:01:18,013 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 09:01:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:18,065 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 09:01:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:01:18,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-18 09:01:18,067 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 49 transitions. [2018-11-18 09:01:18,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 09:01:18,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 09:01:18,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2018-11-18 09:01:18,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:18,068 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 09:01:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2018-11-18 09:01:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-11-18 09:01:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 09:01:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-18 09:01:18,070 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-18 09:01:18,070 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-18 09:01:18,070 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:01:18,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-18 09:01:18,071 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:18,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:18,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:18,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:18,072 INFO L794 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 323#L21-4 assume true; 324#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 349#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 325#L21-4 assume true; 326#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 329#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 330#L21-4 assume true; 337#L21-1 assume !(main_~i~0 < 5); 320#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 321#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 340#L25-4 assume true; 341#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 344#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 345#L25-4 assume true; 346#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 347#L25-3 [2018-11-18 09:01:18,072 INFO L796 eck$LassoCheckResult]: Loop: 347#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 350#L25-4 assume true; 348#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 347#L25-3 [2018-11-18 09:01:18,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 983047030, now seen corresponding path program 1 times [2018-11-18 09:01:18,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:01:18,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:18,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:18,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:18,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:01:18,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:18,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 09:01:18,190 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash 62341, now seen corresponding path program 3 times [2018-11-18 09:01:18,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:01:18,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:01:18,225 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 09:01:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:18,268 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-18 09:01:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:01:18,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-18 09:01:18,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 51 states and 59 transitions. [2018-11-18 09:01:18,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 09:01:18,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 09:01:18,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 59 transitions. [2018-11-18 09:01:18,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:18,270 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-18 09:01:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 59 transitions. [2018-11-18 09:01:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-11-18 09:01:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 09:01:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 09:01:18,272 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 09:01:18,272 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 09:01:18,272 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:01:18,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-18 09:01:18,272 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:18,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:18,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 09:01:18,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:18,273 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 465#L21-4 assume true; 466#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 471#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 467#L21-4 assume true; 468#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 479#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 498#L21-4 assume true; 489#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 492#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 488#L21-4 assume true; 478#L21-1 assume !(main_~i~0 < 5); 462#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 463#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 482#L25-4 assume true; 483#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 486#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 487#L25-4 assume true; 497#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 496#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 495#L25-4 assume true; 494#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 491#L25-3 [2018-11-18 09:01:18,273 INFO L796 eck$LassoCheckResult]: Loop: 491#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 493#L25-4 assume true; 490#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 491#L25-3 [2018-11-18 09:01:18,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1120640782, now seen corresponding path program 2 times [2018-11-18 09:01:18,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 09:01:18,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:18,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:01:18,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:01:18,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:01:18,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 09:01:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 09:01:18,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:18,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash 62341, now seen corresponding path program 4 times [2018-11-18 09:01:18,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:01:18,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:01:18,401 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-18 09:01:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:18,447 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-18 09:01:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:01:18,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 70 transitions. [2018-11-18 09:01:18,449 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 69 transitions. [2018-11-18 09:01:18,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-18 09:01:18,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-18 09:01:18,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 69 transitions. [2018-11-18 09:01:18,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:18,450 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-18 09:01:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 69 transitions. [2018-11-18 09:01:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2018-11-18 09:01:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 09:01:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-18 09:01:18,453 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-18 09:01:18,453 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-18 09:01:18,453 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:01:18,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 50 transitions. [2018-11-18 09:01:18,454 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:18,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:18,455 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-11-18 09:01:18,455 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:18,455 INFO L794 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 641#L21-4 assume true; 642#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 656#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 643#L21-4 assume true; 644#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 647#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 648#L21-4 assume true; 680#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 679#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 678#L21-4 assume true; 666#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 669#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 665#L21-4 assume true; 655#L21-1 assume !(main_~i~0 < 5); 638#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 639#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 659#L25-4 assume true; 660#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 663#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 664#L25-4 assume true; 677#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 676#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 675#L25-4 assume true; 674#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 673#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 672#L25-4 assume true; 671#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 668#L25-3 [2018-11-18 09:01:18,455 INFO L796 eck$LassoCheckResult]: Loop: 668#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 670#L25-4 assume true; 667#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 668#L25-3 [2018-11-18 09:01:18,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1247014794, now seen corresponding path program 3 times [2018-11-18 09:01:18,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 09:01:18,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:18,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:01:18,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 09:01:18,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:01:18,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 09:01:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:18,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 09:01:18,563 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:18,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash 62341, now seen corresponding path program 5 times [2018-11-18 09:01:18,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:01:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:01:18,596 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-18 09:01:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:18,637 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-18 09:01:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:01:18,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-18 09:01:18,639 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 77 transitions. [2018-11-18 09:01:18,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-18 09:01:18,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-18 09:01:18,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 77 transitions. [2018-11-18 09:01:18,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:18,640 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-11-18 09:01:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 77 transitions. [2018-11-18 09:01:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-11-18 09:01:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 09:01:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-18 09:01:18,642 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-18 09:01:18,642 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-18 09:01:18,642 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:01:18,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 56 transitions. [2018-11-18 09:01:18,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-18 09:01:18,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:18,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:18,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-11-18 09:01:18,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:18,644 INFO L794 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 849#L21-4 assume true; 850#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 855#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 851#L21-4 assume true; 852#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 894#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 893#L21-4 assume true; 892#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 891#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 890#L21-4 assume true; 889#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 888#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 887#L21-4 assume true; 872#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 875#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 871#L21-4 assume true; 862#L21-1 assume !(main_~i~0 < 5); 846#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 847#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 865#L25-4 assume true; 866#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 869#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 870#L25-4 assume true; 886#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 885#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 884#L25-4 assume true; 883#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 882#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 881#L25-4 assume true; 880#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 879#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 878#L25-4 assume true; 877#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 874#L25-3 [2018-11-18 09:01:18,644 INFO L796 eck$LassoCheckResult]: Loop: 874#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 876#L25-4 assume true; 873#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 874#L25-3 [2018-11-18 09:01:18,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2045191950, now seen corresponding path program 4 times [2018-11-18 09:01:18,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 62341, now seen corresponding path program 6 times [2018-11-18 09:01:18,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash 92711156, now seen corresponding path program 5 times [2018-11-18 09:01:18,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 09:01:18,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:01:18,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 09:01:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:01:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:01:18,839 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-18 09:01:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:18,879 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-18 09:01:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:01:18,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 57 transitions. [2018-11-18 09:01:18,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 09:01:18,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 57 transitions. [2018-11-18 09:01:18,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 09:01:18,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 09:01:18,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2018-11-18 09:01:18,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:18,881 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-18 09:01:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2018-11-18 09:01:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-18 09:01:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 09:01:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-18 09:01:18,883 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 09:01:18,884 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 09:01:18,884 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:01:18,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-11-18 09:01:18,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 09:01:18,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:18,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:18,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:18,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:18,885 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 983#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 967#L21-4 assume true; 968#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1012#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 969#L21-4 assume true; 970#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 973#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 974#L21-4 assume true; 1011#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1010#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1009#L21-4 assume true; 1008#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1007#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1006#L21-4 assume true; 993#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 994#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 992#L21-4 assume true; 981#L21-1 assume !(main_~i~0 < 5); 964#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 965#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 984#L25-4 assume true; 985#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 988#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 989#L25-4 assume true; 990#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 991#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1005#L25-4 assume true; 1004#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1003#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1002#L25-4 assume true; 1001#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1000#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 999#L25-4 assume true; 998#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 997#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 996#L25-4 assume true; 995#L25-1 assume !(main_~i~0 < 5); 982#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 966#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 962#L30-4 [2018-11-18 09:01:18,885 INFO L796 eck$LassoCheckResult]: Loop: 962#L30-4 assume true; 963#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 971#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 962#L30-4 [2018-11-18 09:01:18,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1098893033, now seen corresponding path program 1 times [2018-11-18 09:01:18,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:18,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 75538, now seen corresponding path program 1 times [2018-11-18 09:01:18,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -881570244, now seen corresponding path program 1 times [2018-11-18 09:01:18,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:21,454 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-11-18 09:01:21,545 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:21,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:21,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:21,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:21,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:21,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:21,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:21,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:21,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-18 09:01:21,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:21,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:21,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:21,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:21,787 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:21,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:21,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:21,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:21,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:21,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:21,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:21,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:21,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:21,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:21,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:21,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:21,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:21,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:21,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:21,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:21,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:21,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:21,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:21,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:21,836 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:21,845 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:01:21,845 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:01:21,845 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:21,846 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:21,846 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:21,846 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-18 09:01:21,904 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 09:01:21,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:21,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:21,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:21,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:21,942 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 [2018-11-18 09:01:21,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 55 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 09:01:21,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 55 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 62 states and 70 transitions. Complement of second has 6 states. [2018-11-18 09:01:21,955 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 [2018-11-18 09:01:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-18 09:01:21,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2018-11-18 09:01:21,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 43 letters. Loop has 3 letters. [2018-11-18 09:01:21,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:21,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 40 letters. Loop has 6 letters. [2018-11-18 09:01:21,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:21,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2018-11-18 09:01:21,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:01:21,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 54 states and 59 transitions. [2018-11-18 09:01:21,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 09:01:21,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 09:01:21,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 59 transitions. [2018-11-18 09:01:21,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:21,959 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-18 09:01:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 59 transitions. [2018-11-18 09:01:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-18 09:01:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 09:01:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-18 09:01:21,962 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-18 09:01:21,962 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-18 09:01:21,962 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 09:01:21,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 59 transitions. [2018-11-18 09:01:21,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:01:21,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:21,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:21,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:21,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:21,964 INFO L794 eck$LassoCheckResult]: Stem: 1307#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1286#L21-4 assume true; 1287#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1302#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1288#L21-4 assume true; 1289#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1293#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1294#L21-4 assume true; 1324#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1323#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1322#L21-4 assume true; 1321#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1320#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1318#L21-4 assume true; 1313#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1315#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1312#L21-4 assume true; 1301#L21-1 assume !(main_~i~0 < 5); 1283#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1284#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1310#L25-4 assume true; 1332#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1309#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1305#L25-4 assume true; 1306#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1311#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1331#L25-4 assume true; 1330#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1329#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1328#L25-4 assume true; 1327#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1326#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1325#L25-4 assume true; 1319#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1317#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1316#L25-4 assume true; 1314#L25-1 assume !(main_~i~0 < 5); 1303#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1285#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1279#L30-4 assume true; 1281#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1290#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1291#L30-5 main_~nc_B~0 := 0; 1299#L34-4 [2018-11-18 09:01:21,964 INFO L796 eck$LassoCheckResult]: Loop: 1299#L34-4 assume true; 1300#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1308#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1299#L34-4 [2018-11-18 09:01:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1558873793, now seen corresponding path program 1 times [2018-11-18 09:01:21,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:21,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:21,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:21,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:21,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 90433, now seen corresponding path program 1 times [2018-11-18 09:01:21,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:21,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1072265027, now seen corresponding path program 1 times [2018-11-18 09:01:21,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:21,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:24,186 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 224 DAG size of output: 166 [2018-11-18 09:01:24,256 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:24,256 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:24,256 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:24,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:24,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:24,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:24,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:24,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:24,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-18 09:01:24,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:24,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:24,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:24,442 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:24,442 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:24,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:24,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:24,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:24,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:24,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:24,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:24,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:24,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,480 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:24,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:24,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:24,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:24,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:24,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:24,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:24,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:24,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:24,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:24,494 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:24,509 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-18 09:01:24,509 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-18 09:01:24,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:24,510 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 09:01:24,510 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:24,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3, ULTIMATE.start_main_~nc_B~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 - 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [1*ULTIMATE.start_main_~#string_B~0.offset >= 0] [2018-11-18 09:01:24,539 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 09:01:24,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:24,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:24,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:24,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:24,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 09:01:24,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 59 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 09:01:24,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 59 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 69 transitions. Complement of second has 7 states. [2018-11-18 09:01:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:01:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:01:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-18 09:01:24,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 44 letters. Loop has 3 letters. [2018-11-18 09:01:24,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:24,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 47 letters. Loop has 3 letters. [2018-11-18 09:01:24,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:24,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 44 letters. Loop has 6 letters. [2018-11-18 09:01:24,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:24,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 69 transitions. [2018-11-18 09:01:24,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:24,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 57 states and 63 transitions. [2018-11-18 09:01:24,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 09:01:24,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 09:01:24,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2018-11-18 09:01:24,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:24,709 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-18 09:01:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2018-11-18 09:01:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-18 09:01:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:01:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-18 09:01:24,712 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-18 09:01:24,712 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-18 09:01:24,712 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 09:01:24,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2018-11-18 09:01:24,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:24,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:24,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:24,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:24,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:24,713 INFO L794 eck$LassoCheckResult]: Stem: 1615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1592#L21-4 assume true; 1593#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1599#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1594#L21-4 assume true; 1595#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1641#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1640#L21-4 assume true; 1639#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1637#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1636#L21-4 assume true; 1634#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1632#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1630#L21-4 assume true; 1621#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1623#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1620#L21-4 assume true; 1609#L21-1 assume !(main_~i~0 < 5); 1589#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1590#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1617#L25-4 assume true; 1638#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1616#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1611#L25-4 assume true; 1612#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1618#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1635#L25-4 assume true; 1633#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1631#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1629#L25-4 assume true; 1628#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1627#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1626#L25-4 assume true; 1625#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1624#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1622#L25-4 assume true; 1619#L25-1 assume !(main_~i~0 < 5); 1608#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1591#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1585#L30-4 assume true; 1587#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1596#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1597#L30-5 main_~nc_B~0 := 0; 1604#L34-4 assume true; 1605#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1613#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1600#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1601#L43-2 [2018-11-18 09:01:24,714 INFO L796 eck$LassoCheckResult]: Loop: 1601#L43-2 assume true; 1602#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1603#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1601#L43-2 [2018-11-18 09:01:24,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1119522517, now seen corresponding path program 1 times [2018-11-18 09:01:24,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:24,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 1 times [2018-11-18 09:01:24,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:24,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1274170872, now seen corresponding path program 1 times [2018-11-18 09:01:24,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:24,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:24,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:01:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:01:24,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:01:24,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:01:24,877 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-18 09:01:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:24,888 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-11-18 09:01:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:01:24,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 78 transitions. [2018-11-18 09:01:24,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:24,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 64 transitions. [2018-11-18 09:01:24,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 09:01:24,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 09:01:24,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2018-11-18 09:01:24,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:24,890 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-18 09:01:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2018-11-18 09:01:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-18 09:01:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:01:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-18 09:01:24,891 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-18 09:01:24,891 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-18 09:01:24,891 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 09:01:24,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2018-11-18 09:01:24,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:24,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:24,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:24,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:24,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:24,893 INFO L794 eck$LassoCheckResult]: Stem: 1752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1729#L21-4 assume true; 1730#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1736#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1731#L21-4 assume true; 1732#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1776#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1774#L21-4 assume true; 1772#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1770#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1768#L21-4 assume true; 1766#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1764#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1762#L21-4 assume true; 1757#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1759#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1756#L21-4 assume true; 1745#L21-1 assume !(main_~i~0 < 5); 1726#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1727#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1754#L25-4 assume true; 1755#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1753#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1748#L25-4 assume true; 1749#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1778#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1777#L25-4 assume true; 1775#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1773#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1771#L25-4 assume true; 1769#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1767#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1765#L25-4 assume true; 1763#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1761#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L25-4 assume true; 1758#L25-1 assume !(main_~i~0 < 5); 1746#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1728#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1722#L30-4 assume true; 1723#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1735#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1724#L30-4 assume true; 1725#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1733#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1734#L30-5 main_~nc_B~0 := 0; 1741#L34-4 assume true; 1742#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1750#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1737#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1738#L43-2 [2018-11-18 09:01:24,893 INFO L796 eck$LassoCheckResult]: Loop: 1738#L43-2 assume true; 1739#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1740#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1738#L43-2 [2018-11-18 09:01:24,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1590128304, now seen corresponding path program 1 times [2018-11-18 09:01:24,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:24,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:25,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:25,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:25,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:01:25,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-18 09:01:25,061 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:25,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 2 times [2018-11-18 09:01:25,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:25,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:25,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:01:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:01:25,100 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-18 09:01:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:25,124 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-18 09:01:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:01:25,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 68 transitions. [2018-11-18 09:01:25,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:25,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 65 transitions. [2018-11-18 09:01:25,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 09:01:25,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 09:01:25,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2018-11-18 09:01:25,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:25,125 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-18 09:01:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2018-11-18 09:01:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-18 09:01:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 09:01:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-18 09:01:25,128 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-18 09:01:25,128 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-18 09:01:25,128 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 09:01:25,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 61 transitions. [2018-11-18 09:01:25,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:25,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:25,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:25,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:25,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:25,129 INFO L794 eck$LassoCheckResult]: Stem: 2035#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2032#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2014#L21-4 assume true; 2015#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2021#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2016#L21-4 assume true; 2017#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2060#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2058#L21-4 assume true; 2056#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2054#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2052#L21-4 assume true; 2050#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2048#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2046#L21-4 assume true; 2041#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2043#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2040#L21-4 assume true; 2030#L21-1 assume !(main_~i~0 < 5); 2011#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2012#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2033#L25-4 assume true; 2034#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2038#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2039#L25-4 assume true; 2063#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2062#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2061#L25-4 assume true; 2059#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2057#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2055#L25-4 assume true; 2053#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2051#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2049#L25-4 assume true; 2047#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2045#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2044#L25-4 assume true; 2042#L25-1 assume !(main_~i~0 < 5); 2031#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2013#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2007#L30-4 assume true; 2008#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2020#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2009#L30-4 assume true; 2010#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2018#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2019#L30-5 main_~nc_B~0 := 0; 2026#L34-4 assume true; 2027#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2037#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2028#L34-4 assume true; 2029#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2036#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2022#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2023#L43-2 [2018-11-18 09:01:25,129 INFO L796 eck$LassoCheckResult]: Loop: 2023#L43-2 assume true; 2024#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2025#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2023#L43-2 [2018-11-18 09:01:25,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:25,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1978433258, now seen corresponding path program 1 times [2018-11-18 09:01:25,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 3 times [2018-11-18 09:01:25,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:25,154 INFO L82 PathProgramCache]: Analyzing trace with hash -330934295, now seen corresponding path program 1 times [2018-11-18 09:01:25,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:27,897 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2018-11-18 09:01:28,055 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-18 09:01:28,056 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:28,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:28,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:28,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:28,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:28,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:28,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:28,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:28,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-18 09:01:28,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:28,057 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:28,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:28,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:28,518 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:28,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:28,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:28,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:28,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:28,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:28,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:28,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:28,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:28,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:28,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:28,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:28,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:28,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:28,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:28,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:28,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:28,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:28,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:28,576 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 09:01:28,576 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 09:01:28,577 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:28,577 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:28,578 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:28,578 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#string_A~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#string_A~0.offset Supporting invariants [] [2018-11-18 09:01:28,653 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 09:01:28,655 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:28,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:28,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:28,700 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 [2018-11-18 09:01:28,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 61 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 09:01:28,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 61 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 63 states and 69 transitions. Complement of second has 7 states. [2018-11-18 09:01:28,711 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 [2018-11-18 09:01:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-18 09:01:28,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 54 letters. Loop has 3 letters. [2018-11-18 09:01:28,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:28,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 57 letters. Loop has 3 letters. [2018-11-18 09:01:28,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:28,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 54 letters. Loop has 6 letters. [2018-11-18 09:01:28,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:28,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2018-11-18 09:01:28,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:28,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 69 transitions. [2018-11-18 09:01:28,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-18 09:01:28,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 09:01:28,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2018-11-18 09:01:28,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:28,714 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-18 09:01:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2018-11-18 09:01:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-18 09:01:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 09:01:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-11-18 09:01:28,716 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-18 09:01:28,717 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-18 09:01:28,717 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 09:01:28,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2018-11-18 09:01:28,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:28,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:28,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:28,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:28,718 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:28,718 INFO L794 eck$LassoCheckResult]: Stem: 2416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2389#L21-4 assume true; 2390#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2439#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2391#L21-4 assume true; 2392#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2396#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2397#L21-4 assume true; 2436#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2434#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2432#L21-4 assume true; 2430#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2428#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2426#L21-4 assume true; 2422#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2423#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2421#L21-4 assume true; 2411#L21-1 assume !(main_~i~0 < 5); 2386#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2387#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2414#L25-4 assume true; 2415#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2419#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2420#L25-4 assume true; 2443#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2442#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2441#L25-4 assume true; 2440#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2438#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2437#L25-4 assume true; 2435#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2433#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2431#L25-4 assume true; 2429#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2427#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2425#L25-4 assume true; 2424#L25-1 assume !(main_~i~0 < 5); 2412#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2388#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2382#L30-4 assume true; 2383#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2395#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2384#L30-4 assume true; 2385#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2393#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2394#L30-5 main_~nc_B~0 := 0; 2404#L34-4 assume true; 2405#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2418#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2406#L34-4 assume true; 2407#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2417#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2398#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2399#L43-2 assume true; 2400#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2401#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2408#L43-2 [2018-11-18 09:01:28,718 INFO L796 eck$LassoCheckResult]: Loop: 2408#L43-2 assume true; 2409#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2444#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2408#L43-2 [2018-11-18 09:01:28,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -330934293, now seen corresponding path program 1 times [2018-11-18 09:01:28,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:28,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:28,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 4 times [2018-11-18 09:01:28,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:28,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:28,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:28,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1913498808, now seen corresponding path program 1 times [2018-11-18 09:01:28,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 09:01:28,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:28,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:28,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:28,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-18 09:01:28,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:28,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 09:01:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:01:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:01:28,917 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-18 09:01:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:28,954 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-18 09:01:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:01:28,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 95 transitions. [2018-11-18 09:01:28,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:28,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 68 states and 74 transitions. [2018-11-18 09:01:28,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 09:01:28,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 09:01:28,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 74 transitions. [2018-11-18 09:01:28,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:28,957 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-18 09:01:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 74 transitions. [2018-11-18 09:01:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-18 09:01:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 09:01:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-11-18 09:01:28,959 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-18 09:01:28,959 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-18 09:01:28,959 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 09:01:28,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 72 transitions. [2018-11-18 09:01:28,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:28,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:28,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:28,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:28,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:28,961 INFO L794 eck$LassoCheckResult]: Stem: 2761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2756#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2731#L21-4 assume true; 2732#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2738#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2733#L21-4 assume true; 2734#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2784#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2782#L21-4 assume true; 2780#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2778#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2776#L21-4 assume true; 2774#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2772#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2770#L21-4 assume true; 2766#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2767#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2765#L21-4 assume true; 2754#L21-1 assume !(main_~i~0 < 5); 2728#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2729#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2763#L25-4 assume true; 2788#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2762#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2757#L25-4 assume true; 2758#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2764#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2787#L25-4 assume true; 2786#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2785#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2783#L25-4 assume true; 2781#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2779#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2777#L25-4 assume true; 2775#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2773#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2771#L25-4 assume true; 2769#L25-1 assume !(main_~i~0 < 5); 2755#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2730#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2724#L30-4 assume true; 2725#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2737#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2726#L30-4 assume true; 2727#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2740#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2768#L30-4 assume true; 2739#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2735#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2736#L30-5 main_~nc_B~0 := 0; 2747#L34-4 assume true; 2748#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2760#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2749#L34-4 assume true; 2750#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2759#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2741#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2742#L43-2 assume true; 2743#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2744#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2751#L43-2 [2018-11-18 09:01:28,961 INFO L796 eck$LassoCheckResult]: Loop: 2751#L43-2 assume true; 2752#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2789#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2751#L43-2 [2018-11-18 09:01:28,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1182044518, now seen corresponding path program 2 times [2018-11-18 09:01:28,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:28,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:28,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:29,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:29,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:29,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 09:01:29,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 09:01:29,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:01:29,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:29,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:29,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 09:01:29,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:29,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:29,112 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 5 times [2018-11-18 09:01:29,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:29,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:29,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 09:01:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:01:29,157 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. cyclomatic complexity: 11 Second operand 13 states. [2018-11-18 09:01:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:29,201 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-18 09:01:29,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:01:29,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2018-11-18 09:01:29,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:29,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 79 transitions. [2018-11-18 09:01:29,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 09:01:29,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 09:01:29,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 79 transitions. [2018-11-18 09:01:29,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:29,203 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-18 09:01:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 79 transitions. [2018-11-18 09:01:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-18 09:01:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 09:01:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-11-18 09:01:29,206 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-18 09:01:29,206 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-11-18 09:01:29,206 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 09:01:29,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 75 transitions. [2018-11-18 09:01:29,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:29,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:29,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:29,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:29,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:29,208 INFO L794 eck$LassoCheckResult]: Stem: 3097#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3094#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3068#L21-4 assume true; 3069#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3075#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3070#L21-4 assume true; 3071#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3092#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3129#L21-4 assume true; 3128#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3127#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3126#L21-4 assume true; 3125#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3119#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3110#L21-4 assume true; 3108#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3109#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3107#L21-4 assume true; 3091#L21-1 assume !(main_~i~0 < 5); 3065#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3066#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3095#L25-4 assume true; 3096#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3100#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3101#L25-4 assume true; 3104#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3105#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3123#L25-4 assume true; 3122#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3121#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3120#L25-4 assume true; 3118#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3117#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3116#L25-4 assume true; 3115#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3114#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3113#L25-4 assume true; 3112#L25-1 assume !(main_~i~0 < 5); 3093#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3067#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3061#L30-4 assume true; 3062#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3074#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3063#L30-4 assume true; 3064#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3077#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3111#L30-4 assume true; 3076#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3072#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3073#L30-5 main_~nc_B~0 := 0; 3084#L34-4 assume true; 3085#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3099#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3086#L34-4 assume true; 3087#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3103#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3106#L34-4 assume true; 3102#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3098#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3078#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3079#L43-2 assume true; 3080#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3081#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3088#L43-2 [2018-11-18 09:01:29,208 INFO L796 eck$LassoCheckResult]: Loop: 3088#L43-2 assume true; 3089#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3124#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3088#L43-2 [2018-11-18 09:01:29,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1891157334, now seen corresponding path program 3 times [2018-11-18 09:01:29,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:29,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:29,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:29,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 6 times [2018-11-18 09:01:29,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:29,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:29,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:29,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1912931369, now seen corresponding path program 2 times [2018-11-18 09:01:29,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:31,477 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 310 DAG size of output: 234 [2018-11-18 09:01:31,635 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-18 09:01:31,637 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:31,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:31,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:31,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:31,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:31,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:31,637 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:31,637 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:31,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration15_Lasso [2018-11-18 09:01:31,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:31,637 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:31,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:31,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:32,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:32,377 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-18 09:01:32,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:32,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:32,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:32,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:32,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:32,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:32,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:32,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:32,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:32,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:32,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:32,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:32,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:32,457 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:32,475 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 09:01:32,475 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 09:01:32,478 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:32,478 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:32,478 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:32,479 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-18 09:01:32,624 INFO L297 tatePredicateManager]: 25 out of 27 supporting invariants were superfluous and have been removed [2018-11-18 09:01:32,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:32,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:32,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:32,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2018-11-18 09:01:32,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 75 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-18 09:01:32,835 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 75 transitions. cyclomatic complexity: 11. Second operand 11 states. Result 115 states and 130 transitions. Complement of second has 15 states. [2018-11-18 09:01:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 09:01:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 09:01:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2018-11-18 09:01:32,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 63 letters. Loop has 3 letters. [2018-11-18 09:01:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 66 letters. Loop has 3 letters. [2018-11-18 09:01:32,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:32,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 66 transitions. Stem has 63 letters. Loop has 6 letters. [2018-11-18 09:01:32,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:32,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 130 transitions. [2018-11-18 09:01:32,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:32,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 130 transitions. [2018-11-18 09:01:32,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-18 09:01:32,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-18 09:01:32,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 130 transitions. [2018-11-18 09:01:32,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:32,839 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 130 transitions. [2018-11-18 09:01:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 130 transitions. [2018-11-18 09:01:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2018-11-18 09:01:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 09:01:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-18 09:01:32,841 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-18 09:01:32,841 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-18 09:01:32,841 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 09:01:32,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 101 transitions. [2018-11-18 09:01:32,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:32,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:32,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:32,843 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:32,843 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:32,843 INFO L794 eck$LassoCheckResult]: Stem: 3643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3640#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3613#L21-4 assume true; 3614#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3671#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3615#L21-4 assume true; 3616#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3621#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3622#L21-4 assume true; 3666#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3664#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3662#L21-4 assume true; 3660#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3658#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3656#L21-4 assume true; 3652#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3653#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3651#L21-4 assume true; 3638#L21-1 assume !(main_~i~0 < 5); 3610#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3611#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3641#L25-4 assume true; 3642#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3647#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3648#L25-4 assume true; 3673#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3672#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3670#L25-4 assume true; 3669#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3668#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3667#L25-4 assume true; 3665#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3663#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3661#L25-4 assume true; 3659#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3657#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3655#L25-4 assume true; 3654#L25-1 assume !(main_~i~0 < 5); 3639#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3612#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3606#L30-4 assume true; 3607#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3674#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3608#L30-4 assume true; 3609#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3695#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3694#L30-4 assume true; 3624#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3619#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3620#L30-4 assume true; 3623#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3617#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3618#L30-5 main_~nc_B~0 := 0; 3631#L34-4 assume true; 3632#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3688#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3633#L34-4 assume true; 3634#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3650#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3675#L34-4 assume true; 3649#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3644#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3625#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3626#L43-2 assume true; 3627#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3628#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3635#L43-2 [2018-11-18 09:01:32,843 INFO L796 eck$LassoCheckResult]: Loop: 3635#L43-2 assume true; 3636#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3696#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3635#L43-2 [2018-11-18 09:01:32,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1127928859, now seen corresponding path program 4 times [2018-11-18 09:01:32,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:32,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:32,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:32,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:32,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:01:32,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:01:32,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:01:32,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 09:01:33,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:33,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-18 09:01:33,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:01:33,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 7 times [2018-11-18 09:01:33,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 09:01:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:01:33,085 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. cyclomatic complexity: 16 Second operand 17 states. [2018-11-18 09:01:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:33,163 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-11-18 09:01:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:01:33,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 130 transitions. [2018-11-18 09:01:33,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 09:01:33,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 127 transitions. [2018-11-18 09:01:33,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-18 09:01:33,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-18 09:01:33,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 127 transitions. [2018-11-18 09:01:33,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:33,165 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-11-18 09:01:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 127 transitions. [2018-11-18 09:01:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2018-11-18 09:01:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:01:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-11-18 09:01:33,167 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-18 09:01:33,167 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-18 09:01:33,167 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 09:01:33,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 104 transitions. [2018-11-18 09:01:33,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:33,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:33,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:33,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:33,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:33,169 INFO L794 eck$LassoCheckResult]: Stem: 4075#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4043#L21-4 assume true; 4044#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4106#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4045#L21-4 assume true; 4046#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4051#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4052#L21-4 assume true; 4099#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4097#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4095#L21-4 assume true; 4093#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4091#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4089#L21-4 assume true; 4085#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4086#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4084#L21-4 assume true; 4070#L21-1 assume !(main_~i~0 < 5); 4040#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4041#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4073#L25-4 assume true; 4074#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4078#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4079#L25-4 assume true; 4108#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4107#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4103#L25-4 assume true; 4102#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4101#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4100#L25-4 assume true; 4098#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4096#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4094#L25-4 assume true; 4092#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4090#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4088#L25-4 assume true; 4087#L25-1 assume !(main_~i~0 < 5); 4071#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4042#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4036#L30-4 assume true; 4037#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4109#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4038#L30-4 assume true; 4039#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4049#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4050#L30-4 assume true; 4053#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4054#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4082#L30-5 main_~nc_B~0 := 0; 4083#L34-4 assume true; 4124#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4123#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4122#L34-4 assume true; 4121#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4120#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4119#L34-4 assume true; 4066#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4081#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4125#L34-4 assume true; 4080#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4076#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4057#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4058#L43-2 assume true; 4059#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4060#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4067#L43-2 [2018-11-18 09:01:33,169 INFO L796 eck$LassoCheckResult]: Loop: 4067#L43-2 assume true; 4068#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4127#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4067#L43-2 [2018-11-18 09:01:33,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 170318566, now seen corresponding path program 5 times [2018-11-18 09:01:33,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:33,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 8 times [2018-11-18 09:01:33,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1604102765, now seen corresponding path program 3 times [2018-11-18 09:01:33,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:33,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:35,861 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 322 DAG size of output: 242 [2018-11-18 09:01:35,980 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-18 09:01:35,982 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:35,982 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:35,982 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:35,982 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:35,982 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:35,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:35,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:35,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:35,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-18 09:01:35,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:35,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:35,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:35,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:36,703 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-18 09:01:36,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:36,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:36,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:36,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:36,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:36,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,771 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-18 09:01:36,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,773 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-18 09:01:36,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:36,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:36,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:36,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:36,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:36,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:36,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:36,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:36,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:36,812 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 09:01:36,812 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 09:01:36,812 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:36,813 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:36,813 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:36,813 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-18 09:01:36,999 INFO L297 tatePredicateManager]: 32 out of 34 supporting invariants were superfluous and have been removed [2018-11-18 09:01:37,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:37,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:37,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:37,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-11-18 09:01:37,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 104 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-18 09:01:37,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 104 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 126 states and 145 transitions. Complement of second has 12 states. [2018-11-18 09:01:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 09:01:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 09:01:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2018-11-18 09:01:37,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 51 transitions. Stem has 66 letters. Loop has 3 letters. [2018-11-18 09:01:37,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:37,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 51 transitions. Stem has 69 letters. Loop has 3 letters. [2018-11-18 09:01:37,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:37,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 51 transitions. Stem has 66 letters. Loop has 6 letters. [2018-11-18 09:01:37,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:37,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 145 transitions. [2018-11-18 09:01:37,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:37,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 122 states and 139 transitions. [2018-11-18 09:01:37,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-18 09:01:37,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-18 09:01:37,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 139 transitions. [2018-11-18 09:01:37,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:37,170 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-11-18 09:01:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 139 transitions. [2018-11-18 09:01:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2018-11-18 09:01:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:01:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-11-18 09:01:37,172 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-18 09:01:37,172 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-18 09:01:37,172 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 09:01:37,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 104 transitions. [2018-11-18 09:01:37,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:37,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:37,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:37,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:37,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:37,174 INFO L794 eck$LassoCheckResult]: Stem: 4684#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4652#L21-4 assume true; 4653#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4659#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4654#L21-4 assume true; 4655#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4709#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4707#L21-4 assume true; 4705#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4703#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4701#L21-4 assume true; 4699#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4697#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4695#L21-4 assume true; 4691#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4692#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4690#L21-4 assume true; 4676#L21-1 assume !(main_~i~0 < 5); 4649#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4650#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4679#L25-4 assume true; 4680#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4685#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4686#L25-4 assume true; 4713#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4712#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4711#L25-4 assume true; 4710#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4708#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4706#L25-4 assume true; 4704#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4702#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4700#L25-4 assume true; 4698#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4696#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4694#L25-4 assume true; 4693#L25-1 assume !(main_~i~0 < 5); 4677#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4651#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4645#L30-4 assume true; 4646#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4658#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4647#L30-4 assume true; 4648#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4726#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4725#L30-4 assume true; 4724#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4723#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4722#L30-5 main_~nc_B~0 := 0; 4669#L34-4 assume true; 4670#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4721#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4718#L34-4 assume true; 4716#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4717#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4715#L34-4 assume true; 4687#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4681#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4682#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4732#L43-2 assume true; 4728#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4727#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4661#L43-2 assume true; 4665#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4666#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4673#L43-2 [2018-11-18 09:01:37,174 INFO L796 eck$LassoCheckResult]: Loop: 4673#L43-2 assume true; 4674#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4729#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4673#L43-2 [2018-11-18 09:01:37,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1912931371, now seen corresponding path program 6 times [2018-11-18 09:01:37,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 9 times [2018-11-18 09:01:37,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1782497528, now seen corresponding path program 4 times [2018-11-18 09:01:37,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:37,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-18 09:01:37,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:01:37,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0697bd48-d2ad-4cba-adbf-7405b91b428e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:01:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 09:01:37,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 09:01:37,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:01:37,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-18 09:01:37,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:01:37,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 09:01:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:01:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:01:37,448 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. cyclomatic complexity: 17 Second operand 14 states. [2018-11-18 09:01:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:01:37,677 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-11-18 09:01:37,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 09:01:37,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 143 transitions. [2018-11-18 09:01:37,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:37,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 79 states and 85 transitions. [2018-11-18 09:01:37,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 09:01:37,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 09:01:37,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 85 transitions. [2018-11-18 09:01:37,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:37,679 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-18 09:01:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 85 transitions. [2018-11-18 09:01:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-18 09:01:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 09:01:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-11-18 09:01:37,680 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-18 09:01:37,680 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-18 09:01:37,680 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 09:01:37,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 81 transitions. [2018-11-18 09:01:37,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:37,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:37,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:37,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:37,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:37,681 INFO L794 eck$LassoCheckResult]: Stem: 5152#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 5121#L21-4 assume true; 5122#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5129#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5123#L21-4 assume true; 5124#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5183#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5182#L21-4 assume true; 5181#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5180#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5178#L21-4 assume true; 5176#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5174#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5172#L21-4 assume true; 5167#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5169#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5166#L21-4 assume true; 5146#L21-1 assume !(main_~i~0 < 5); 5118#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 5119#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 5148#L25-4 assume true; 5149#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5154#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5155#L25-4 assume true; 5179#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5177#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5175#L25-4 assume true; 5173#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5171#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5170#L25-4 assume true; 5168#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5165#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5164#L25-4 assume true; 5162#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5161#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5160#L25-4 assume true; 5159#L25-1 assume !(main_~i~0 < 5); 5145#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 5120#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 5114#L30-4 assume true; 5115#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5127#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5128#L30-4 assume true; 5187#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5188#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5116#L30-4 assume true; 5117#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5131#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5163#L30-4 assume true; 5130#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5125#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 5126#L30-5 main_~nc_B~0 := 0; 5138#L34-4 assume true; 5139#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5184#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5185#L34-4 assume true; 5186#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5151#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5140#L34-4 assume true; 5141#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5157#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5158#L34-4 assume true; 5156#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5150#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 5132#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5133#L43-2 assume true; 5144#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5153#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5142#L43-2 [2018-11-18 09:01:37,681 INFO L796 eck$LassoCheckResult]: Loop: 5142#L43-2 assume true; 5134#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5135#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 5142#L43-2 [2018-11-18 09:01:37,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash -47047733, now seen corresponding path program 7 times [2018-11-18 09:01:37,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 10 times [2018-11-18 09:01:37,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:37,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1439595672, now seen corresponding path program 5 times [2018-11-18 09:01:37,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:37,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:40,430 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 334 DAG size of output: 252 [2018-11-18 09:01:40,679 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-18 09:01:40,681 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:40,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:40,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:40,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:40,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:40,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:40,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:40,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:40,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration19_Lasso [2018-11-18 09:01:40,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:40,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:40,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:41,367 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-18 09:01:41,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:41,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:41,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:41,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:41,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:41,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:41,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:41,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:41,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:41,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:41,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:41,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:41,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:41,417 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:41,422 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:01:41,422 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:01:41,423 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:41,423 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:41,423 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:41,423 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 09:01:41,569 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2018-11-18 09:01:41,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:41,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:41,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:41,606 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 [2018-11-18 09:01:41,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 81 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 09:01:41,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 81 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 81 states and 89 transitions. Complement of second has 7 states. [2018-11-18 09:01:41,616 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 [2018-11-18 09:01:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-18 09:01:41,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 69 letters. Loop has 3 letters. [2018-11-18 09:01:41,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:41,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 72 letters. Loop has 3 letters. [2018-11-18 09:01:41,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:41,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 69 letters. Loop has 6 letters. [2018-11-18 09:01:41,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:41,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-18 09:01:41,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:41,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 89 transitions. [2018-11-18 09:01:41,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 09:01:41,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-18 09:01:41,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 89 transitions. [2018-11-18 09:01:41,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:41,619 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-18 09:01:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 89 transitions. [2018-11-18 09:01:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-18 09:01:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 09:01:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-18 09:01:41,620 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-18 09:01:41,620 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-18 09:01:41,620 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 09:01:41,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 89 transitions. [2018-11-18 09:01:41,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:01:41,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:41,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:41,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:41,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:41,622 INFO L794 eck$LassoCheckResult]: Stem: 5668#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 5641#L21-4 assume true; 5642#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5648#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5643#L21-4 assume true; 5644#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5704#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5702#L21-4 assume true; 5687#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5686#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5685#L21-4 assume true; 5683#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5681#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5680#L21-4 assume true; 5675#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 5676#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5674#L21-4 assume true; 5663#L21-1 assume !(main_~i~0 < 5); 5638#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 5639#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 5666#L25-4 assume true; 5667#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5671#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5672#L25-4 assume true; 5707#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5706#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5705#L25-4 assume true; 5703#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5701#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5700#L25-4 assume true; 5699#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5698#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5697#L25-4 assume true; 5695#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 5693#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5692#L25-4 assume true; 5690#L25-1 assume !(main_~i~0 < 5); 5664#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 5640#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 5634#L30-4 assume true; 5635#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5647#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5636#L30-4 assume true; 5637#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5696#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5694#L30-4 assume true; 5689#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5691#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 5688#L30-4 assume true; 5649#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5645#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 5646#L30-5 main_~nc_B~0 := 0; 5656#L34-4 assume true; 5657#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5670#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5658#L34-4 assume true; 5659#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5684#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5682#L34-4 assume true; 5678#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5679#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 5677#L34-4 assume true; 5673#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5669#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 5650#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5651#L43-2 assume true; 5711#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5709#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5708#L43-2 assume true; 5652#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5653#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5660#L43-2 [2018-11-18 09:01:41,622 INFO L796 eck$LassoCheckResult]: Loop: 5660#L43-2 assume true; 5661#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 5710#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 5660#L43-2 [2018-11-18 09:01:41,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1439595670, now seen corresponding path program 8 times [2018-11-18 09:01:41,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:41,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:41,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:41,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash 109426, now seen corresponding path program 11 times [2018-11-18 09:01:41,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:41,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:41,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:41,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1746074775, now seen corresponding path program 6 times [2018-11-18 09:01:41,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:41,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:44,284 WARN L180 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 358 DAG size of output: 265 [2018-11-18 09:01:44,464 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 09:01:44,466 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:44,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:44,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:44,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:44,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:44,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:44,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:44,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:44,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration20_Lasso [2018-11-18 09:01:44,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:44,466 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:44,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:45,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 09:01:45,979 WARN L180 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-11-18 09:01:45,999 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:45,999 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:46,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:46,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:46,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:46,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:46,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:46,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:46,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:46,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,032 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:46,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,033 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:46,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:46,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:46,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:46,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:46,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:46,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:46,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:46,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:46,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:46,057 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:01:46,057 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:01:46,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:46,058 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:46,058 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:46,059 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_8, ULTIMATE.start_main_~#string_B~0.offset) = -1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_8 - 1*ULTIMATE.start_main_~#string_B~0.offset Supporting invariants [] [2018-11-18 09:01:46,258 INFO L297 tatePredicateManager]: 47 out of 47 supporting invariants were superfluous and have been removed [2018-11-18 09:01:46,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:46,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:46,294 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 [2018-11-18 09:01:46,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 09:01:46,305 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 85 states and 95 transitions. Complement of second has 7 states. [2018-11-18 09:01:46,305 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 [2018-11-18 09:01:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-18 09:01:46,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 72 letters. Loop has 3 letters. [2018-11-18 09:01:46,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:46,305 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:01:46,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:46,350 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 09:01:46,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 09:01:46,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 85 states and 95 transitions. Complement of second has 7 states. [2018-11-18 09:01:46,362 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 [2018-11-18 09:01:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-18 09:01:46,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 72 letters. Loop has 3 letters. [2018-11-18 09:01:46,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:46,363 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:01:46,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:46,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:46,420 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 2 loop predicates [2018-11-18 09:01:46,420 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 09:01:46,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 89 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 88 states and 99 transitions. Complement of second has 6 states. [2018-11-18 09:01:46,430 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 [2018-11-18 09:01:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-18 09:01:46,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 72 letters. Loop has 3 letters. [2018-11-18 09:01:46,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:46,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 75 letters. Loop has 3 letters. [2018-11-18 09:01:46,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:46,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 72 letters. Loop has 6 letters. [2018-11-18 09:01:46,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:46,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 99 transitions. [2018-11-18 09:01:46,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:01:46,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 84 states and 93 transitions. [2018-11-18 09:01:46,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 09:01:46,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-18 09:01:46,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 93 transitions. [2018-11-18 09:01:46,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:46,432 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-18 09:01:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 93 transitions. [2018-11-18 09:01:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2018-11-18 09:01:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 09:01:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-11-18 09:01:46,433 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-18 09:01:46,433 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-18 09:01:46,433 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 09:01:46,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 77 transitions. [2018-11-18 09:01:46,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:01:46,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:46,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:46,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:46,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:46,434 INFO L794 eck$LassoCheckResult]: Stem: 6913#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6908#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 6884#L21-4 assume true; 6885#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 6906#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6886#L21-4 assume true; 6887#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 6891#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6892#L21-4 assume true; 6931#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 6930#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6929#L21-4 assume true; 6927#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 6925#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6924#L21-4 assume true; 6919#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 6920#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6918#L21-4 assume true; 6905#L21-1 assume !(main_~i~0 < 5); 6881#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 6882#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 6916#L25-4 assume true; 6948#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 6914#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6909#L25-4 assume true; 6910#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 6917#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6947#L25-4 assume true; 6946#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 6945#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6944#L25-4 assume true; 6943#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 6942#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6941#L25-4 assume true; 6939#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 6937#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6936#L25-4 assume true; 6934#L25-1 assume !(main_~i~0 < 5); 6907#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 6883#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 6877#L30-4 assume true; 6878#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6890#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 6879#L30-4 assume true; 6880#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6940#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 6938#L30-4 assume true; 6933#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6935#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 6932#L30-4 assume true; 6893#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6888#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 6889#L30-5 main_~nc_B~0 := 0; 6900#L34-4 assume true; 6901#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6912#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 6902#L34-4 assume true; 6903#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6928#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 6926#L34-4 assume true; 6922#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6923#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 6921#L34-4 assume true; 6915#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6911#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 6894#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6895#L43-2 [2018-11-18 09:01:46,434 INFO L796 eck$LassoCheckResult]: Loop: 6895#L43-2 assume true; 6896#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 6897#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 6895#L43-2 [2018-11-18 09:01:46,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1126545654, now seen corresponding path program 2 times [2018-11-18 09:01:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:46,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:46,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:46,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash 109428, now seen corresponding path program 1 times [2018-11-18 09:01:46,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:46,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash -47047733, now seen corresponding path program 9 times [2018-11-18 09:01:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:01:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:49,421 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 309 DAG size of output: 233 [2018-11-18 09:01:49,552 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-18 09:01:49,554 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:49,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:49,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:49,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:49,554 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:49,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:49,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:49,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:49,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration21_Lasso [2018-11-18 09:01:49,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:49,554 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:49,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,930 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2018-11-18 09:01:49,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:49,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:50,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:50,219 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:50,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:50,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:50,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:50,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:50,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:50,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,244 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:50,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,245 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:50,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,251 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:50,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,251 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:50,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:50,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:50,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:50,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:50,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:50,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:50,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:50,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:50,266 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:50,278 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:01:50,278 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-18 09:01:50,278 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:50,279 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:50,279 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:50,279 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 09:01:50,475 INFO L297 tatePredicateManager]: 49 out of 50 supporting invariants were superfluous and have been removed [2018-11-18 09:01:50,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:50,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:50,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:50,526 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 [2018-11-18 09:01:50,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 77 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 09:01:50,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 77 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 85 states and 95 transitions. Complement of second has 8 states. [2018-11-18 09:01:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 09:01:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:01:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-18 09:01:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 3 letters. [2018-11-18 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 69 letters. Loop has 3 letters. [2018-11-18 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:50,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 6 letters. [2018-11-18 09:01:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:50,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 95 transitions. [2018-11-18 09:01:50,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:01:50,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 81 states and 89 transitions. [2018-11-18 09:01:50,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-18 09:01:50,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-18 09:01:50,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 89 transitions. [2018-11-18 09:01:50,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:01:50,547 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-18 09:01:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 89 transitions. [2018-11-18 09:01:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-11-18 09:01:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 09:01:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-11-18 09:01:50,548 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-18 09:01:50,548 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-18 09:01:50,548 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 09:01:50,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 83 transitions. [2018-11-18 09:01:50,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:01:50,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:01:50,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:01:50,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:01:50,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:01:50,550 INFO L794 eck$LassoCheckResult]: Stem: 7510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 7482#L21-4 assume true; 7483#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 7489#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7484#L21-4 assume true; 7485#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 7544#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7542#L21-4 assume true; 7530#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 7529#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7528#L21-4 assume true; 7526#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 7524#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7523#L21-4 assume true; 7518#L21-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 7519#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7517#L21-4 assume true; 7503#L21-1 assume !(main_~i~0 < 5); 7479#L21-5 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 7480#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 7515#L25-4 assume true; 7549#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 7513#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7506#L25-4 assume true; 7507#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 7516#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7548#L25-4 assume true; 7547#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 7546#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7545#L25-4 assume true; 7543#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 7541#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7540#L25-4 assume true; 7539#L25-1 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 7533#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 7532#L25-4 assume true; 7531#L25-1 assume !(main_~i~0 < 5); 7504#L25-5 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 7481#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 7475#L30-4 assume true; 7476#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 7488#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 7477#L30-4 assume true; 7478#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 7538#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 7537#L30-4 assume true; 7535#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 7536#L30-2 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 7534#L30-4 assume true; 7492#L30-1 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 7486#L30-2 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 7487#L30-5 main_~nc_B~0 := 0; 7497#L34-4 assume true; 7498#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 7509#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 7499#L34-4 assume true; 7500#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 7527#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 7525#L34-4 assume true; 7521#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 7522#L34-2 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 7520#L34-4 assume true; 7514#L34-1 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 7508#L34-2 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 7490#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 7491#L43-2 assume true; 7495#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 7496#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 7512#L43-2 assume true; 7493#L41-1 [2018-11-18 09:01:50,550 INFO L796 eck$LassoCheckResult]: Loop: 7493#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 7494#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 7511#L43-2 assume true; 7493#L41-1 [2018-11-18 09:01:50,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1458479705, now seen corresponding path program 2 times [2018-11-18 09:01:50,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:50,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:50,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash 115338, now seen corresponding path program 2 times [2018-11-18 09:01:50,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:50,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:50,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1679639772, now seen corresponding path program 7 times [2018-11-18 09:01:50,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:01:50,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:01:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:01:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:01:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:01:54,879 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 332 DAG size of output: 247 [2018-11-18 09:01:54,984 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:01:54,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:01:54,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:01:54,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:01:54,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:01:54,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:01:54,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:01:54,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:01:54,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration22_Lasso [2018-11-18 09:01:54,984 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:01:54,984 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:01:54,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:54,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:01:55,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:01:55,696 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:01:55,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:01:55,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:01:55,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:01:55,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,731 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:55,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:55,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,739 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-18 09:01:55,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:01:55,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,742 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-11-18 09:01:55,743 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 09:01:55,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,762 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:55,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,763 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:55,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,764 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:01:55,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:01:55,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:01:55,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:01:55,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:01:55,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:01:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:01:55,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:01:55,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:01:55,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:01:55,793 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:01:55,803 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 09:01:55,803 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 09:01:55,803 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:01:55,804 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:01:55,804 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:01:55,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_10 Supporting invariants [] [2018-11-18 09:01:56,164 INFO L297 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 09:01:56,168 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:01:56,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:01:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:56,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:01:56,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:01:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:01:56,249 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 09:01:56,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 83 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 09:01:56,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 83 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 91 states and 104 transitions. Complement of second has 7 states. [2018-11-18 09:01:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:01:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:01:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 09:01:56,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 70 letters. Loop has 3 letters. [2018-11-18 09:01:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:56,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 73 letters. Loop has 3 letters. [2018-11-18 09:01:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:56,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 70 letters. Loop has 6 letters. [2018-11-18 09:01:56,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:01:56,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 104 transitions. [2018-11-18 09:01:56,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:01:56,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-11-18 09:01:56,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:01:56,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:01:56,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:01:56,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:01:56,299 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:01:56,299 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:01:56,299 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:01:56,300 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 09:01:56,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:01:56,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:01:56,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:01:56,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:01:56 BoogieIcfgContainer [2018-11-18 09:01:56,306 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:01:56,306 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:01:56,306 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:01:56,306 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:01:56,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:16" (3/4) ... [2018-11-18 09:01:56,310 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:01:56,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:01:56,311 INFO L168 Benchmark]: Toolchain (without parser) took 39961.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.7 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -250.7 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:01:56,311 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:01:56,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:01:56,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.48 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:01:56,313 INFO L168 Benchmark]: Boogie Preprocessor took 58.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:01:56,313 INFO L168 Benchmark]: RCFGBuilder took 224.47 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:01:56,313 INFO L168 Benchmark]: BuchiAutomizer took 39476.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:01:56,314 INFO L168 Benchmark]: Witness Printer took 4.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:01:56,317 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 941.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.48 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.47 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 39476.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.6 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 - 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 22 terminating modules (12 trivial, 9 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[string_A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * nc_B and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * i + -1 * string_A and consists of 4 locations. One deterministic module has affine ranking function -1 * j + nc_A and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 9 locations. One deterministic module has affine ranking function nc_B + -1 * j and consists of 4 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + j + unknown-#length-unknown[string_A] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + unknown-#length-unknown[string_B] + -1 * string_B and consists of 4 locations. 12 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 39.4s and 23 iterations. TraceHistogramMax:6. Analysis of lassos took 37.3s. Construction of modules took 0.6s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 21. Automata minimization 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 164 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 16. Nontrivial modules had stage [9, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 555 SDtfs, 911 SDslu, 829 SDs, 0 SdLazy, 873 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU8 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital316 mio100 ax100 hnf99 lsp96 ukn45 mio100 lsp57 div100 bol100 ite100 ukn100 eq170 hnf85 smp96 dnf346 smp83 tf100 neg93 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 44 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...