./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-1dbac8b [2018-11-10 04:48:01,290 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:48:01,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:48:01,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:48:01,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:48:01,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:48:01,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:48:01,303 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:48:01,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:48:01,305 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:48:01,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:48:01,306 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:48:01,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:48:01,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:48:01,308 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:48:01,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:48:01,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:48:01,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:48:01,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:48:01,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:48:01,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:48:01,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:48:01,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:48:01,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:48:01,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:48:01,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:48:01,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:48:01,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:48:01,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:48:01,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:48:01,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:48:01,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:48:01,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:48:01,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:48:01,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:48:01,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:48:01,321 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:48:01,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:48:01,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:48:01,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:48:01,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:48:01,332 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:48:01,332 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:48:01,332 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:48:01,332 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:48:01,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:48:01,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:48:01,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:48:01,335 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:48:01,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:48:01,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:48:01,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:48:01,335 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:48:01,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:48:01,335 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:48:01,336 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:48:01,336 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:48:01,336 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_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:01,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:48:01,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:48:01,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:48:01,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:48:01,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:48:01,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-10 04:48:01,421 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/data/ec5c8553e/311b860e8c864b2193f4e57ff20757bf/FLAG010012002 [2018-11-10 04:48:01,765 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:48:01,766 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-10 04:48:01,771 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/data/ec5c8553e/311b860e8c864b2193f4e57ff20757bf/FLAG010012002 [2018-11-10 04:48:01,782 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/data/ec5c8553e/311b860e8c864b2193f4e57ff20757bf [2018-11-10 04:48:01,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:48:01,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:48:01,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:48:01,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:48:01,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:48:01,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:01,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d27cab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01, skipping insertion in model container [2018-11-10 04:48:01,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:01,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:48:01,817 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:48:01,952 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:48:01,955 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:48:01,973 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:48:01,989 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:48:01,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01 WrapperNode [2018-11-10 04:48:01,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:48:01,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:48:01,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:48:01,991 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:48:01,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:48:02,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:48:02,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:48:02,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:48:02,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... [2018-11-10 04:48:02,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:48:02,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:48:02,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:48:02,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:48:02,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:48:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:48:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:48:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:48:02,345 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:48:02,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:48:02 BoogieIcfgContainer [2018-11-10 04:48:02,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:48:02,346 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:48:02,346 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:48:02,349 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:48:02,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:48:02,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:48:01" (1/3) ... [2018-11-10 04:48:02,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3916ab45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:48:02, skipping insertion in model container [2018-11-10 04:48:02,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:48:02,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:48:01" (2/3) ... [2018-11-10 04:48:02,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3916ab45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:48:02, skipping insertion in model container [2018-11-10 04:48:02,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:48:02,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:48:02" (3/3) ... [2018-11-10 04:48:02,353 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-10 04:48:02,397 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:48:02,398 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:48:02,398 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:48:02,398 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:48:02,398 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:48:02,398 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:48:02,398 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:48:02,398 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:48:02,398 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:48:02,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 04:48:02,423 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-10 04:48:02,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:02,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:02,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:48:02,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:02,427 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:48:02,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-10 04:48:02,430 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-10 04:48:02,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:02,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:02,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:48:02,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:02,435 INFO L793 eck$LassoCheckResult]: Stem: 35#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 23#L21-4true [2018-11-10 04:48:02,436 INFO L795 eck$LassoCheckResult]: Loop: 23#L21-4true assume true; 32#L21-1true assume !!(main_~i~0 < 5); 36#L22true SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 34#L22-1true havoc main_#t~nondet2; 26#L21-3true main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 23#L21-4true [2018-11-10 04:48:02,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 04:48:02,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:02,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 04:48:02,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:02,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 04:48:02,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:02,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:02,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:02,733 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:02,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:02,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:02,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:02,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:02,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:02,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:02,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:02,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 04:48:02,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:02,735 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:02,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:02,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:03,067 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:03,072 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:03,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:03,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:03,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:03,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:03,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:03,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:03,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:03,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:03,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:03,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:03,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:03,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:03,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:03,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,125 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:03,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:03,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:03,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:03,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:03,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:03,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:03,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:03,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:03,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:03,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:03,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:03,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:03,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:03,189 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:48:03,190 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:48:03,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:03,193 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:03,193 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:03,194 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-11-10 04:48:03,208 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:48:03,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:03,271 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-10 04:48:03,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 4 states. [2018-11-10 04:48:03,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 4 states. Result 78 states and 105 transitions. Complement of second has 8 states. [2018-11-10 04:48:03,318 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-10 04:48:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-10 04:48:03,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 04:48:03,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:03,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 04:48:03,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:03,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 04:48:03,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:03,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 105 transitions. [2018-11-10 04:48:03,325 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 31 states and 40 transitions. [2018-11-10 04:48:03,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 04:48:03,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 04:48:03,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-10 04:48:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:03,331 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-10 04:48:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-10 04:48:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 04:48:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 04:48:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-11-10 04:48:03,350 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-10 04:48:03,350 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-10 04:48:03,350 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:48:03,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2018-11-10 04:48:03,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:03,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:03,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:48:03,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:03,351 INFO L793 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 178#L21-4 assume true; 196#L21-1 assume !(main_~i~0 < 5); 195#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 190#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 181#L25-4 [2018-11-10 04:48:03,352 INFO L795 eck$LassoCheckResult]: Loop: 181#L25-4 assume true; 183#L25-1 assume !!(main_~i~0 < 5); 191#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 192#L26-1 havoc main_#t~nondet5; 188#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 181#L25-4 [2018-11-10 04:48:03,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,352 INFO L82 PathProgramCache]: Analyzing trace with hash 889538731, now seen corresponding path program 1 times [2018-11-10 04:48:03,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:03,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:48:03,384 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:03,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 55504638, now seen corresponding path program 1 times [2018-11-10 04:48:03,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:48:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:48:03,416 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-10 04:48:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:03,438 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-10 04:48:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:48:03,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2018-11-10 04:48:03,440 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 51 transitions. [2018-11-10 04:48:03,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 04:48:03,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 04:48:03,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2018-11-10 04:48:03,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:03,442 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-10 04:48:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2018-11-10 04:48:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2018-11-10 04:48:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 04:48:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 04:48:03,444 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 04:48:03,444 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 04:48:03,444 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:48:03,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-10 04:48:03,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:03,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:03,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:03,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:03,446 INFO L793 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 261#L21-4 assume true; 278#L21-1 assume !!(main_~i~0 < 5); 286#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 288#L22-1 havoc main_#t~nondet2; 285#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 279#L21-4 assume true; 280#L21-1 assume !(main_~i~0 < 5); 277#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 273#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 264#L25-4 assume true; 265#L25-1 assume !!(main_~i~0 < 5); 274#L26 [2018-11-10 04:48:03,446 INFO L795 eck$LassoCheckResult]: Loop: 274#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 275#L26-1 havoc main_#t~nondet5; 270#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 271#L25-4 assume true; 290#L25-1 assume !!(main_~i~0 < 5); 274#L26 [2018-11-10 04:48:03,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1269562707, now seen corresponding path program 1 times [2018-11-10 04:48:03,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,473 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-10 04:48:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:03,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:03,499 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-10 04:48:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 04:48:03,516 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:03,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 2 times [2018-11-10 04:48:03,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:48:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:48:03,545 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-10 04:48:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:03,593 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-10 04:48:03,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:48:03,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 68 transitions. [2018-11-10 04:48:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 67 transitions. [2018-11-10 04:48:03,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 04:48:03,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 04:48:03,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 67 transitions. [2018-11-10 04:48:03,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:03,595 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 04:48:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 67 transitions. [2018-11-10 04:48:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-11-10 04:48:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 04:48:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-10 04:48:03,598 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 04:48:03,598 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 04:48:03,598 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:48:03,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2018-11-10 04:48:03,598 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:03,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:03,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:03,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:03,599 INFO L793 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 398#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 399#L21-4 assume true; 416#L21-1 assume !!(main_~i~0 < 5); 436#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 434#L22-1 havoc main_#t~nondet2; 432#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 417#L21-4 assume true; 418#L21-1 assume !!(main_~i~0 < 5); 426#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 428#L22-1 havoc main_#t~nondet2; 423#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 424#L21-4 assume true; 425#L21-1 assume !(main_~i~0 < 5); 415#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 411#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 402#L25-4 assume true; 403#L25-1 assume !!(main_~i~0 < 5); 412#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 413#L26-1 havoc main_#t~nondet5; 408#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 409#L25-4 assume true; 438#L25-1 assume !!(main_~i~0 < 5); 431#L26 [2018-11-10 04:48:03,599 INFO L795 eck$LassoCheckResult]: Loop: 431#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 437#L26-1 havoc main_#t~nondet5; 435#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 433#L25-4 assume true; 430#L25-1 assume !!(main_~i~0 < 5); 431#L26 [2018-11-10 04:48:03,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1009916615, now seen corresponding path program 1 times [2018-11-10 04:48:03,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:48:03,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:03,627 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:03,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:48:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:48:03,694 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:03,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 3 times [2018-11-10 04:48:03,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:03,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:48:03,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:48:03,731 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-10 04:48:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:03,816 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-10 04:48:03,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:48:03,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 84 transitions. [2018-11-10 04:48:03,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 83 transitions. [2018-11-10 04:48:03,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-10 04:48:03,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 04:48:03,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 83 transitions. [2018-11-10 04:48:03,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:03,819 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-10 04:48:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 83 transitions. [2018-11-10 04:48:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-11-10 04:48:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 04:48:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-10 04:48:03,821 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 04:48:03,821 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 04:48:03,821 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:48:03,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-11-10 04:48:03,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:03,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:03,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:03,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 04:48:03,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:03,822 INFO L793 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 593#L21-4 assume true; 612#L21-1 assume !!(main_~i~0 < 5); 634#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 633#L22-1 havoc main_#t~nondet2; 619#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 620#L21-4 assume true; 637#L21-1 assume !!(main_~i~0 < 5); 640#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 639#L22-1 havoc main_#t~nondet2; 638#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 613#L21-4 assume true; 614#L21-1 assume !!(main_~i~0 < 5); 622#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 624#L22-1 havoc main_#t~nondet2; 625#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 629#L21-4 assume true; 621#L21-1 assume !(main_~i~0 < 5); 611#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 605#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 596#L25-4 assume true; 597#L25-1 assume !!(main_~i~0 < 5); 635#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 636#L26-1 havoc main_#t~nondet5; 602#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 603#L25-4 assume true; 606#L25-1 assume !!(main_~i~0 < 5); 607#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 627#L26-1 havoc main_#t~nondet5; 628#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 642#L25-4 assume true; 641#L25-1 assume !!(main_~i~0 < 5); 608#L26 [2018-11-10 04:48:03,822 INFO L795 eck$LassoCheckResult]: Loop: 608#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 609#L26-1 havoc main_#t~nondet5; 632#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 631#L25-4 assume true; 630#L25-1 assume !!(main_~i~0 < 5); 608#L26 [2018-11-10 04:48:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2044161363, now seen corresponding path program 2 times [2018-11-10 04:48:03,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:48:03,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:03,872 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:03,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:48:03,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:48:03,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:03,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:48:03,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 04:48:03,949 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:03,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 4 times [2018-11-10 04:48:03,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:03,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:03,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:48:03,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:48:03,972 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 04:48:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:04,025 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-10 04:48:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:48:04,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 100 transitions. [2018-11-10 04:48:04,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:04,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 99 transitions. [2018-11-10 04:48:04,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-10 04:48:04,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 04:48:04,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 99 transitions. [2018-11-10 04:48:04,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:04,028 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-10 04:48:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 99 transitions. [2018-11-10 04:48:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-11-10 04:48:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 04:48:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-10 04:48:04,031 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-10 04:48:04,031 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-10 04:48:04,031 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:48:04,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 68 transitions. [2018-11-10 04:48:04,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:04,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:04,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:04,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-11-10 04:48:04,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:04,034 INFO L793 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 842#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 843#L21-4 assume true; 860#L21-1 assume !!(main_~i~0 < 5); 869#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 874#L22-1 havoc main_#t~nondet2; 867#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 861#L21-4 assume true; 862#L21-1 assume !!(main_~i~0 < 5); 902#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 871#L22-1 havoc main_#t~nondet2; 872#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 901#L21-4 assume true; 900#L21-1 assume !!(main_~i~0 < 5); 899#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 898#L22-1 havoc main_#t~nondet2; 897#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 896#L21-4 assume true; 877#L21-1 assume !!(main_~i~0 < 5); 885#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 883#L22-1 havoc main_#t~nondet2; 880#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 876#L21-4 assume true; 868#L21-1 assume !(main_~i~0 < 5); 859#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 854#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 855#L25-4 assume true; 895#L25-1 assume !!(main_~i~0 < 5); 894#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 893#L26-1 havoc main_#t~nondet5; 852#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 846#L25-4 assume true; 847#L25-1 assume !!(main_~i~0 < 5); 856#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 857#L26-1 havoc main_#t~nondet5; 875#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 892#L25-4 assume true; 891#L25-1 assume !!(main_~i~0 < 5); 890#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 889#L26-1 havoc main_#t~nondet5; 888#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 887#L25-4 assume true; 886#L25-1 assume !!(main_~i~0 < 5); 879#L26 [2018-11-10 04:48:04,034 INFO L795 eck$LassoCheckResult]: Loop: 879#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 884#L26-1 havoc main_#t~nondet5; 882#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 881#L25-4 assume true; 878#L25-1 assume !!(main_~i~0 < 5); 879#L26 [2018-11-10 04:48:04,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash 333055417, now seen corresponding path program 3 times [2018-11-10 04:48:04,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:48:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:04,079 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:48:04,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 04:48:04,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:04,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:48:04,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:04,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 04:48:04,149 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:04,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 5 times [2018-11-10 04:48:04,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:48:04,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:48:04,202 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-10 04:48:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:04,258 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-11-10 04:48:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:48:04,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 110 transitions. [2018-11-10 04:48:04,259 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:04,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 99 states and 109 transitions. [2018-11-10 04:48:04,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 04:48:04,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:48:04,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2018-11-10 04:48:04,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:04,261 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-10 04:48:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2018-11-10 04:48:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2018-11-10 04:48:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 04:48:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-11-10 04:48:04,266 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-10 04:48:04,266 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-10 04:48:04,266 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:48:04,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 78 transitions. [2018-11-10 04:48:04,267 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:04,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:04,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:04,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-11-10 04:48:04,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:04,268 INFO L793 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1142#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1143#L21-4 assume true; 1160#L21-1 assume !!(main_~i~0 < 5); 1170#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1172#L22-1 havoc main_#t~nondet2; 1173#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1161#L21-4 assume true; 1162#L21-1 assume !!(main_~i~0 < 5); 1212#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1211#L22-1 havoc main_#t~nondet2; 1167#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1168#L21-4 assume true; 1210#L21-1 assume !!(main_~i~0 < 5); 1209#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1208#L22-1 havoc main_#t~nondet2; 1207#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1206#L21-4 assume true; 1205#L21-1 assume !!(main_~i~0 < 5); 1204#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1203#L22-1 havoc main_#t~nondet2; 1201#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1199#L21-4 assume true; 1177#L21-1 assume !!(main_~i~0 < 5); 1184#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1182#L22-1 havoc main_#t~nondet2; 1180#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1176#L21-4 assume true; 1169#L21-1 assume !(main_~i~0 < 5); 1159#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 1154#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1155#L25-4 assume true; 1202#L25-1 assume !!(main_~i~0 < 5); 1200#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1175#L26-1 havoc main_#t~nondet5; 1152#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1146#L25-4 assume true; 1147#L25-1 assume !!(main_~i~0 < 5); 1156#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1157#L26-1 havoc main_#t~nondet5; 1198#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1197#L25-4 assume true; 1196#L25-1 assume !!(main_~i~0 < 5); 1195#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1194#L26-1 havoc main_#t~nondet5; 1193#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1192#L25-4 assume true; 1191#L25-1 assume !!(main_~i~0 < 5); 1190#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1189#L26-1 havoc main_#t~nondet5; 1188#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1187#L25-4 assume true; 1186#L25-1 assume !!(main_~i~0 < 5); 1179#L26 [2018-11-10 04:48:04,268 INFO L795 eck$LassoCheckResult]: Loop: 1179#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1185#L26-1 havoc main_#t~nondet5; 1183#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1181#L25-4 assume true; 1178#L25-1 assume !!(main_~i~0 < 5); 1179#L26 [2018-11-10 04:48:04,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1493339475, now seen corresponding path program 4 times [2018-11-10 04:48:04,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash 61108008, now seen corresponding path program 6 times [2018-11-10 04:48:04,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 589260054, now seen corresponding path program 5 times [2018-11-10 04:48:04,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:48:04,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:04,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 04:48:04,483 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 04:48:04,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:04,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:48:04,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:48:04,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-11-10 04:48:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 04:48:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:48:04,560 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. cyclomatic complexity: 10 Second operand 14 states. [2018-11-10 04:48:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:04,682 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-11-10 04:48:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:48:04,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 113 transitions. [2018-11-10 04:48:04,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-10 04:48:04,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 103 states and 112 transitions. [2018-11-10 04:48:04,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 04:48:04,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-11-10 04:48:04,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 112 transitions. [2018-11-10 04:48:04,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:48:04,684 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-11-10 04:48:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 112 transitions. [2018-11-10 04:48:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2018-11-10 04:48:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 04:48:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-10 04:48:04,687 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 04:48:04,687 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 04:48:04,687 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:48:04,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 76 transitions. [2018-11-10 04:48:04,688 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-10 04:48:04,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:04,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:04,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:04,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 04:48:04,689 INFO L793 eck$LassoCheckResult]: Stem: 1540#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1512#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1513#L21-4 assume true; 1530#L21-1 assume !!(main_~i~0 < 5); 1537#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1539#L22-1 havoc main_#t~nondet2; 1535#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1536#L21-4 assume true; 1581#L21-1 assume !!(main_~i~0 < 5); 1579#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1577#L22-1 havoc main_#t~nondet2; 1575#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1573#L21-4 assume true; 1571#L21-1 assume !!(main_~i~0 < 5); 1569#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1567#L22-1 havoc main_#t~nondet2; 1565#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1563#L21-4 assume true; 1561#L21-1 assume !!(main_~i~0 < 5); 1559#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1557#L22-1 havoc main_#t~nondet2; 1555#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1553#L21-4 assume true; 1551#L21-1 assume !!(main_~i~0 < 5); 1549#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1547#L22-1 havoc main_#t~nondet2; 1545#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1543#L21-4 assume true; 1541#L21-1 assume !(main_~i~0 < 5); 1529#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 1525#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1516#L25-4 assume true; 1517#L25-1 assume !!(main_~i~0 < 5); 1526#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1527#L26-1 havoc main_#t~nondet5; 1522#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1523#L25-4 assume true; 1582#L25-1 assume !!(main_~i~0 < 5); 1580#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1578#L26-1 havoc main_#t~nondet5; 1576#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1574#L25-4 assume true; 1572#L25-1 assume !!(main_~i~0 < 5); 1570#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1568#L26-1 havoc main_#t~nondet5; 1566#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1564#L25-4 assume true; 1562#L25-1 assume !!(main_~i~0 < 5); 1560#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1558#L26-1 havoc main_#t~nondet5; 1556#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1554#L25-4 assume true; 1552#L25-1 assume !!(main_~i~0 < 5); 1550#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1548#L26-1 havoc main_#t~nondet5; 1546#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1544#L25-4 assume true; 1542#L25-1 assume !(main_~i~0 < 5); 1538#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 1510#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 1511#L30-4 [2018-11-10 04:48:04,689 INFO L795 eck$LassoCheckResult]: Loop: 1511#L30-4 assume true; 1528#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 1531#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 1511#L30-4 [2018-11-10 04:48:04,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -656771783, now seen corresponding path program 1 times [2018-11-10 04:48:04,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash 79510, now seen corresponding path program 1 times [2018-11-10 04:48:04,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1982862942, now seen corresponding path program 1 times [2018-11-10 04:48:04,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:04,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:07,381 WARN L179 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 223 DAG size of output: 169 [2018-11-10 04:48:07,492 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-10 04:48:07,494 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:07,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:07,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:07,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:07,494 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:07,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:07,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:07,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:07,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-10 04:48:07,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:07,494 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:07,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:07,781 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:07,782 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:07,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,820 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:07,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:07,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,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-10 04:48:07,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:07,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:07,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:07,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:07,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:07,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:07,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:07,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:07,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:07,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:07,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:07,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:07,882 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 04:48:07,882 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 04:48:07,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:07,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:07,884 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:07,884 INFO L519 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-10 04:48:07,933 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2018-11-10 04:48:07,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:48:07,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:07,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:07,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:08,017 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-10 04:48:08,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-10 04:48:08,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 76 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 86 states and 93 transitions. Complement of second has 6 states. [2018-11-10 04:48:08,039 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-10 04:48:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 04:48:08,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 60 letters. Loop has 3 letters. [2018-11-10 04:48:08,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:08,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 63 letters. Loop has 3 letters. [2018-11-10 04:48:08,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:08,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 60 letters. Loop has 6 letters. [2018-11-10 04:48:08,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:08,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 93 transitions. [2018-11-10 04:48:08,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 04:48:08,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 76 states and 80 transitions. [2018-11-10 04:48:08,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 04:48:08,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:48:08,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 80 transitions. [2018-11-10 04:48:08,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:08,043 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-10 04:48:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 80 transitions. [2018-11-10 04:48:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-10 04:48:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 04:48:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-10 04:48:08,046 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-10 04:48:08,046 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-10 04:48:08,047 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:48:08,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 80 transitions. [2018-11-10 04:48:08,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 04:48:08,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:08,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:08,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:08,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 04:48:08,049 INFO L793 eck$LassoCheckResult]: Stem: 1954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1923#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1924#L21-4 assume true; 1996#L21-1 assume !!(main_~i~0 < 5); 1955#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1953#L22-1 havoc main_#t~nondet2; 1950#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1943#L21-4 assume true; 1944#L21-1 assume !!(main_~i~0 < 5); 1951#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1995#L22-1 havoc main_#t~nondet2; 1994#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1993#L21-4 assume true; 1992#L21-1 assume !!(main_~i~0 < 5); 1991#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1990#L22-1 havoc main_#t~nondet2; 1989#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1988#L21-4 assume true; 1987#L21-1 assume !!(main_~i~0 < 5); 1986#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1985#L22-1 havoc main_#t~nondet2; 1983#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1981#L21-4 assume true; 1980#L21-1 assume !!(main_~i~0 < 5); 1978#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 1976#L22-1 havoc main_#t~nondet2; 1974#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 1972#L21-4 assume true; 1970#L21-1 assume !(main_~i~0 < 5); 1942#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 1936#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 1927#L25-4 assume true; 1928#L25-1 assume !!(main_~i~0 < 5); 1937#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1938#L26-1 havoc main_#t~nondet5; 1933#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1934#L25-4 assume true; 1984#L25-1 assume !!(main_~i~0 < 5); 1982#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1956#L26-1 havoc main_#t~nondet5; 1957#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1979#L25-4 assume true; 1977#L25-1 assume !!(main_~i~0 < 5); 1975#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1973#L26-1 havoc main_#t~nondet5; 1971#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1969#L25-4 assume true; 1968#L25-1 assume !!(main_~i~0 < 5); 1967#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1966#L26-1 havoc main_#t~nondet5; 1965#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1964#L25-4 assume true; 1963#L25-1 assume !!(main_~i~0 < 5); 1962#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 1961#L26-1 havoc main_#t~nondet5; 1960#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 1959#L25-4 assume true; 1958#L25-1 assume !(main_~i~0 < 5); 1952#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 1921#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 1922#L30-4 assume true; 1940#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 1945#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 1946#L30-5 main_~nc_B~0 := 0; 1931#L34-4 [2018-11-10 04:48:08,049 INFO L795 eck$LassoCheckResult]: Loop: 1931#L34-4 assume true; 1935#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 1929#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 1931#L34-4 [2018-11-10 04:48:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1339209057, now seen corresponding path program 1 times [2018-11-10 04:48:08,053 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:08,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:08,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 94405, now seen corresponding path program 1 times [2018-11-10 04:48:08,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:08,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:08,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash 425869157, now seen corresponding path program 1 times [2018-11-10 04:48:08,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:08,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:08,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:10,527 WARN L179 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 234 DAG size of output: 176 [2018-11-10 04:48:10,616 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:10,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:10,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:10,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:10,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:10,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:10,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:10,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:10,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-10 04:48:10,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:10,616 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:10,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:10,906 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:10,906 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:10,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:10,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,939 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:10,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,940 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:10,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,948 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:10,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,949 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:10,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:10,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,952 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:48:10,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 04:48:10,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:10,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:10,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:10,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:10,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:10,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:10,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:10,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:10,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:10,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:10,980 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:48:10,981 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 04:48:10,981 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:10,982 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:10,982 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:10,982 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_1) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_1 Supporting invariants [] [2018-11-10 04:48:11,046 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 04:48:11,047 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:48:11,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:11,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:11,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:11,085 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-10 04:48:11,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 80 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 04:48:11,102 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 80 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 85 states and 92 transitions. Complement of second has 6 states. [2018-11-10 04:48:11,103 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-10 04:48:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 04:48:11,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 64 letters. Loop has 3 letters. [2018-11-10 04:48:11,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:11,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 67 letters. Loop has 3 letters. [2018-11-10 04:48:11,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:11,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 64 letters. Loop has 6 letters. [2018-11-10 04:48:11,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:11,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 04:48:11,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 79 states and 84 transitions. [2018-11-10 04:48:11,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 04:48:11,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:48:11,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 84 transitions. [2018-11-10 04:48:11,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:11,107 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 04:48:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 84 transitions. [2018-11-10 04:48:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 04:48:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 04:48:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-10 04:48:11,116 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 04:48:11,116 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-10 04:48:11,116 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 04:48:11,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 84 transitions. [2018-11-10 04:48:11,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:11,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:11,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:11,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:11,118 INFO L793 eck$LassoCheckResult]: Stem: 2370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2336#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2337#L21-4 assume true; 2358#L21-1 assume !!(main_~i~0 < 5); 2367#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2369#L22-1 havoc main_#t~nondet2; 2364#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2365#L21-4 assume true; 2399#L21-1 assume !!(main_~i~0 < 5); 2397#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2395#L22-1 havoc main_#t~nondet2; 2393#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2391#L21-4 assume true; 2389#L21-1 assume !!(main_~i~0 < 5); 2387#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2385#L22-1 havoc main_#t~nondet2; 2384#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2383#L21-4 assume true; 2382#L21-1 assume !!(main_~i~0 < 5); 2381#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2380#L22-1 havoc main_#t~nondet2; 2379#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2378#L21-4 assume true; 2377#L21-1 assume !!(main_~i~0 < 5); 2376#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2375#L22-1 havoc main_#t~nondet2; 2374#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2373#L21-4 assume true; 2372#L21-1 assume !(main_~i~0 < 5); 2357#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 2350#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2351#L25-4 assume true; 2412#L25-1 assume !!(main_~i~0 < 5); 2411#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2371#L26-1 havoc main_#t~nondet5; 2347#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2340#L25-4 assume true; 2341#L25-1 assume !!(main_~i~0 < 5); 2352#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2356#L26-1 havoc main_#t~nondet5; 2410#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2409#L25-4 assume true; 2408#L25-1 assume !!(main_~i~0 < 5); 2407#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2406#L26-1 havoc main_#t~nondet5; 2405#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2404#L25-4 assume true; 2403#L25-1 assume !!(main_~i~0 < 5); 2402#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2401#L26-1 havoc main_#t~nondet5; 2400#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2398#L25-4 assume true; 2396#L25-1 assume !!(main_~i~0 < 5); 2394#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2392#L26-1 havoc main_#t~nondet5; 2390#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2388#L25-4 assume true; 2386#L25-1 assume !(main_~i~0 < 5); 2368#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 2334#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2335#L30-4 assume true; 2354#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 2359#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2360#L30-5 main_~nc_B~0 := 0; 2366#L34-4 assume true; 2348#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 2342#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2343#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2362#L43-4 [2018-11-10 04:48:11,118 INFO L795 eck$LassoCheckResult]: Loop: 2362#L43-4 assume true; 2363#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2346#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 2338#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 2339#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2362#L43-4 [2018-11-10 04:48:11,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 317041997, now seen corresponding path program 1 times [2018-11-10 04:48:11,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 1 times [2018-11-10 04:48:11,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1295148115, now seen corresponding path program 1 times [2018-11-10 04:48:11,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:48:11,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:48:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:48:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:48:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:48:11,223 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:48:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:11,232 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-11-10 04:48:11,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:48:11,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 99 transitions. [2018-11-10 04:48:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 81 states and 85 transitions. [2018-11-10 04:48:11,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 04:48:11,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:48:11,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 85 transitions. [2018-11-10 04:48:11,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:11,234 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-10 04:48:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 85 transitions. [2018-11-10 04:48:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-10 04:48:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 04:48:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-10 04:48:11,237 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-10 04:48:11,237 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-10 04:48:11,237 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 04:48:11,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 83 transitions. [2018-11-10 04:48:11,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:11,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:11,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:11,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:11,238 INFO L793 eck$LassoCheckResult]: Stem: 2551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2517#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2518#L21-4 assume true; 2539#L21-1 assume !!(main_~i~0 < 5); 2548#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2550#L22-1 havoc main_#t~nondet2; 2545#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2546#L21-4 assume true; 2592#L21-1 assume !!(main_~i~0 < 5); 2590#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2588#L22-1 havoc main_#t~nondet2; 2586#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2584#L21-4 assume true; 2582#L21-1 assume !!(main_~i~0 < 5); 2580#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2578#L22-1 havoc main_#t~nondet2; 2576#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2574#L21-4 assume true; 2572#L21-1 assume !!(main_~i~0 < 5); 2570#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2568#L22-1 havoc main_#t~nondet2; 2566#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2564#L21-4 assume true; 2562#L21-1 assume !!(main_~i~0 < 5); 2560#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2558#L22-1 havoc main_#t~nondet2; 2556#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2554#L21-4 assume true; 2552#L21-1 assume !(main_~i~0 < 5); 2538#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 2532#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2521#L25-4 assume true; 2522#L25-1 assume !!(main_~i~0 < 5); 2533#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2534#L26-1 havoc main_#t~nondet5; 2528#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2529#L25-4 assume true; 2593#L25-1 assume !!(main_~i~0 < 5); 2591#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2589#L26-1 havoc main_#t~nondet5; 2587#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2585#L25-4 assume true; 2583#L25-1 assume !!(main_~i~0 < 5); 2581#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2579#L26-1 havoc main_#t~nondet5; 2577#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2575#L25-4 assume true; 2573#L25-1 assume !!(main_~i~0 < 5); 2571#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2569#L26-1 havoc main_#t~nondet5; 2567#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2565#L25-4 assume true; 2563#L25-1 assume !!(main_~i~0 < 5); 2561#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2559#L26-1 havoc main_#t~nondet5; 2557#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2555#L25-4 assume true; 2553#L25-1 assume !(main_~i~0 < 5); 2549#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 2515#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2516#L30-4 assume true; 2535#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 2542#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 2536#L30-4 assume true; 2537#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 2540#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2541#L30-5 main_~nc_B~0 := 0; 2547#L34-4 assume true; 2530#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 2523#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2524#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2543#L43-4 [2018-11-10 04:48:11,239 INFO L795 eck$LassoCheckResult]: Loop: 2543#L43-4 assume true; 2544#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2527#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 2519#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 2520#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2543#L43-4 [2018-11-10 04:48:11,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 49174898, now seen corresponding path program 1 times [2018-11-10 04:48:11,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:48:11,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:11,278 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:11,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:11,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:48:11,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:48:11,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-10 04:48:11,350 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:11,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 2 times [2018-11-10 04:48:11,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:48:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:48:11,390 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. cyclomatic complexity: 7 Second operand 9 states. [2018-11-10 04:48:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:11,414 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-10 04:48:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:48:11,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 89 transitions. [2018-11-10 04:48:11,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 86 transitions. [2018-11-10 04:48:11,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 04:48:11,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:48:11,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 86 transitions. [2018-11-10 04:48:11,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:11,415 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-11-10 04:48:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 86 transitions. [2018-11-10 04:48:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-10 04:48:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 04:48:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-11-10 04:48:11,417 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-10 04:48:11,417 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-10 04:48:11,417 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 04:48:11,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 82 transitions. [2018-11-10 04:48:11,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:11,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:11,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:11,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:11,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:11,418 INFO L793 eck$LassoCheckResult]: Stem: 2940#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2906#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2907#L21-4 assume true; 2928#L21-1 assume !!(main_~i~0 < 5); 2937#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2939#L22-1 havoc main_#t~nondet2; 2934#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2935#L21-4 assume true; 2981#L21-1 assume !!(main_~i~0 < 5); 2979#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2977#L22-1 havoc main_#t~nondet2; 2975#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2973#L21-4 assume true; 2971#L21-1 assume !!(main_~i~0 < 5); 2969#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2967#L22-1 havoc main_#t~nondet2; 2965#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2963#L21-4 assume true; 2961#L21-1 assume !!(main_~i~0 < 5); 2959#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2957#L22-1 havoc main_#t~nondet2; 2955#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2953#L21-4 assume true; 2951#L21-1 assume !!(main_~i~0 < 5); 2949#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 2947#L22-1 havoc main_#t~nondet2; 2945#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 2943#L21-4 assume true; 2941#L21-1 assume !(main_~i~0 < 5); 2927#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 2921#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 2910#L25-4 assume true; 2911#L25-1 assume !!(main_~i~0 < 5); 2922#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2923#L26-1 havoc main_#t~nondet5; 2917#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2918#L25-4 assume true; 2982#L25-1 assume !!(main_~i~0 < 5); 2980#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2978#L26-1 havoc main_#t~nondet5; 2976#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2974#L25-4 assume true; 2972#L25-1 assume !!(main_~i~0 < 5); 2970#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2968#L26-1 havoc main_#t~nondet5; 2966#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2964#L25-4 assume true; 2962#L25-1 assume !!(main_~i~0 < 5); 2960#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2958#L26-1 havoc main_#t~nondet5; 2956#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2954#L25-4 assume true; 2952#L25-1 assume !!(main_~i~0 < 5); 2950#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 2948#L26-1 havoc main_#t~nondet5; 2946#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 2944#L25-4 assume true; 2942#L25-1 assume !(main_~i~0 < 5); 2938#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 2904#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 2905#L30-4 assume true; 2924#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 2931#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 2925#L30-4 assume true; 2926#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 2929#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 2930#L30-5 main_~nc_B~0 := 0; 2936#L34-4 assume true; 2920#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 2914#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 2915#L34-4 assume true; 2919#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 2912#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 2913#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2932#L43-4 [2018-11-10 04:48:11,418 INFO L795 eck$LassoCheckResult]: Loop: 2932#L43-4 assume true; 2933#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 2916#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 2908#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 2909#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 2932#L43-4 [2018-11-10 04:48:11,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 387005196, now seen corresponding path program 1 times [2018-11-10 04:48:11,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:11,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 3 times [2018-11-10 04:48:11,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:11,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1925172558, now seen corresponding path program 1 times [2018-11-10 04:48:11,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:11,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:11,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:15,701 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 271 DAG size of output: 209 [2018-11-10 04:48:15,897 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:48:15,899 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:15,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:15,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:15,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:15,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:15,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:15,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:15,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:15,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-10 04:48:15,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:15,900 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:15,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:15,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,164 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-11-10 04:48:16,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,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-10 04:48:16,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:16,568 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:16,568 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:16,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,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-10 04:48:16,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,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-10 04:48:16,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:16,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:16,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:16,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,593 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 04:48:16,593 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:48:16,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,596 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-10 04:48:16,596 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 04:48:16,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,621 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:16,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:16,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:16,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:16,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:16,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:16,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:16,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:16,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:16,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:16,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:16,696 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 04:48:16,696 INFO L444 ModelExtractionUtils]: 28 out of 40 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-10 04:48:16,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:16,697 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:16,697 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:16,697 INFO L519 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) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 04:48:16,754 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2018-11-10 04:48:16,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:48:16,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:16,819 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-10 04:48:16,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 82 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 04:48:16,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 82 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 91 states and 96 transitions. Complement of second has 11 states. [2018-11-10 04:48:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-10 04:48:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 04:48:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-10 04:48:16,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 74 letters. Loop has 5 letters. [2018-11-10 04:48:16,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 79 letters. Loop has 5 letters. [2018-11-10 04:48:16,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 74 letters. Loop has 10 letters. [2018-11-10 04:48:16,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:16,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 96 transitions. [2018-11-10 04:48:16,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:16,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 87 states and 91 transitions. [2018-11-10 04:48:16,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-10 04:48:16,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 04:48:16,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 91 transitions. [2018-11-10 04:48:16,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:16,854 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-10 04:48:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 91 transitions. [2018-11-10 04:48:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-10 04:48:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 04:48:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-10 04:48:16,856 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-10 04:48:16,856 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-10 04:48:16,857 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 04:48:16,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 89 transitions. [2018-11-10 04:48:16,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:16,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:16,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:16,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 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, 1, 1] [2018-11-10 04:48:16,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:16,859 INFO L793 eck$LassoCheckResult]: Stem: 3470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3430#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 3431#L21-4 assume true; 3455#L21-1 assume !!(main_~i~0 < 5); 3467#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3469#L22-1 havoc main_#t~nondet2; 3463#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3464#L21-4 assume true; 3512#L21-1 assume !!(main_~i~0 < 5); 3511#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3510#L22-1 havoc main_#t~nondet2; 3508#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3506#L21-4 assume true; 3504#L21-1 assume !!(main_~i~0 < 5); 3502#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3500#L22-1 havoc main_#t~nondet2; 3498#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3496#L21-4 assume true; 3494#L21-1 assume !!(main_~i~0 < 5); 3492#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3490#L22-1 havoc main_#t~nondet2; 3488#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3486#L21-4 assume true; 3484#L21-1 assume !!(main_~i~0 < 5); 3482#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3480#L22-1 havoc main_#t~nondet2; 3478#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3476#L21-4 assume true; 3474#L21-1 assume !(main_~i~0 < 5); 3454#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 3448#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 3436#L25-4 assume true; 3437#L25-1 assume !!(main_~i~0 < 5); 3449#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3450#L26-1 havoc main_#t~nondet5; 3444#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3445#L25-4 assume true; 3509#L25-1 assume !!(main_~i~0 < 5); 3507#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3505#L26-1 havoc main_#t~nondet5; 3503#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3501#L25-4 assume true; 3499#L25-1 assume !!(main_~i~0 < 5); 3497#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3495#L26-1 havoc main_#t~nondet5; 3493#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3491#L25-4 assume true; 3489#L25-1 assume !!(main_~i~0 < 5); 3487#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3485#L26-1 havoc main_#t~nondet5; 3483#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3481#L25-4 assume true; 3479#L25-1 assume !!(main_~i~0 < 5); 3477#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3475#L26-1 havoc main_#t~nondet5; 3473#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3472#L25-4 assume true; 3471#L25-1 assume !(main_~i~0 < 5); 3468#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 3428#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 3429#L30-4 assume true; 3451#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 3458#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3452#L30-4 assume true; 3453#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 3456#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 3457#L30-5 main_~nc_B~0 := 0; 3466#L34-4 assume true; 3447#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 3440#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 3441#L34-4 assume true; 3446#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 3438#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 3439#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3465#L43-4 assume true; 3462#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3443#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 3434#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 3435#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 3459#L43-4 [2018-11-10 04:48:16,859 INFO L795 eck$LassoCheckResult]: Loop: 3459#L43-4 assume true; 3460#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3442#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 3432#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 3433#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 3459#L43-4 [2018-11-10 04:48:16,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1925172556, now seen corresponding path program 1 times [2018-11-10 04:48:16,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 4 times [2018-11-10 04:48:16,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:16,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash -997022962, now seen corresponding path program 1 times [2018-11-10 04:48:16,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-10 04:48:16,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:16,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:16,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:17,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-10 04:48:17,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:17,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-10 04:48:17,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:48:17,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:48:17,107 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. cyclomatic complexity: 8 Second operand 9 states. [2018-11-10 04:48:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:17,135 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-10 04:48:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:48:17,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 125 transitions. [2018-11-10 04:48:17,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:48:17,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 115 states and 123 transitions. [2018-11-10 04:48:17,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-10 04:48:17,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2018-11-10 04:48:17,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 123 transitions. [2018-11-10 04:48:17,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:17,138 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-11-10 04:48:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 123 transitions. [2018-11-10 04:48:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2018-11-10 04:48:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 04:48:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-11-10 04:48:17,140 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-11-10 04:48:17,140 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-11-10 04:48:17,140 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 04:48:17,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 109 transitions. [2018-11-10 04:48:17,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:17,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:17,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:17,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 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, 1, 1] [2018-11-10 04:48:17,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:17,142 INFO L793 eck$LassoCheckResult]: Stem: 3946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3895#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 3896#L21-4 assume true; 3989#L21-1 assume !!(main_~i~0 < 5); 3987#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3945#L22-1 havoc main_#t~nondet2; 3933#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3924#L21-4 assume true; 3925#L21-1 assume !!(main_~i~0 < 5); 3943#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3947#L22-1 havoc main_#t~nondet2; 3984#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3982#L21-4 assume true; 3980#L21-1 assume !!(main_~i~0 < 5); 3978#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3976#L22-1 havoc main_#t~nondet2; 3974#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3972#L21-4 assume true; 3970#L21-1 assume !!(main_~i~0 < 5); 3968#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3966#L22-1 havoc main_#t~nondet2; 3964#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3962#L21-4 assume true; 3960#L21-1 assume !!(main_~i~0 < 5); 3958#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 3956#L22-1 havoc main_#t~nondet2; 3954#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 3952#L21-4 assume true; 3950#L21-1 assume !(main_~i~0 < 5); 3923#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 3916#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 3901#L25-4 assume true; 3902#L25-1 assume !!(main_~i~0 < 5); 3917#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3922#L26-1 havoc main_#t~nondet5; 3910#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3911#L25-4 assume true; 3990#L25-1 assume !!(main_~i~0 < 5); 3988#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3986#L26-1 havoc main_#t~nondet5; 3985#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3983#L25-4 assume true; 3981#L25-1 assume !!(main_~i~0 < 5); 3979#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3977#L26-1 havoc main_#t~nondet5; 3975#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3973#L25-4 assume true; 3971#L25-1 assume !!(main_~i~0 < 5); 3969#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3967#L26-1 havoc main_#t~nondet5; 3965#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3963#L25-4 assume true; 3961#L25-1 assume !!(main_~i~0 < 5); 3959#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 3957#L26-1 havoc main_#t~nondet5; 3955#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 3953#L25-4 assume true; 3951#L25-1 assume !(main_~i~0 < 5); 3944#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 3893#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 3894#L30-4 assume true; 3918#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 3995#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3919#L30-4 assume true; 3920#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 3928#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 3929#L30-4 assume true; 3934#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 3935#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 3948#L30-5 main_~nc_B~0 := 0; 3949#L34-4 assume true; 3941#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 3905#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 3906#L34-4 assume true; 3940#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 3903#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 3904#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3930#L43-4 assume true; 3931#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3908#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 3909#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 3991#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 3942#L43-4 [2018-11-10 04:48:17,142 INFO L795 eck$LassoCheckResult]: Loop: 3942#L43-4 assume true; 3938#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 3907#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 3897#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 3898#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 3942#L43-4 [2018-11-10 04:48:17,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 629180423, now seen corresponding path program 2 times [2018-11-10 04:48:17,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:48:17,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:17,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:17,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:48:17,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:48:17,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:17,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-10 04:48:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-10 04:48:17,327 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:17,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 5 times [2018-11-10 04:48:17,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 04:48:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-10 04:48:17,370 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. cyclomatic complexity: 11 Second operand 13 states. [2018-11-10 04:48:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:17,431 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-10 04:48:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:48:17,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 133 transitions. [2018-11-10 04:48:17,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:48:17,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 130 transitions. [2018-11-10 04:48:17,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-10 04:48:17,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2018-11-10 04:48:17,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 130 transitions. [2018-11-10 04:48:17,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:17,432 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-11-10 04:48:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 130 transitions. [2018-11-10 04:48:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-11-10 04:48:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 04:48:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-11-10 04:48:17,434 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-11-10 04:48:17,434 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-11-10 04:48:17,434 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 04:48:17,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 112 transitions. [2018-11-10 04:48:17,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:17,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:17,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:17,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:17,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:17,436 INFO L793 eck$LassoCheckResult]: Stem: 4431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4386#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 4387#L21-4 assume true; 4413#L21-1 assume !!(main_~i~0 < 5); 4428#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4430#L22-1 havoc main_#t~nondet2; 4420#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4421#L21-4 assume true; 4474#L21-1 assume !!(main_~i~0 < 5); 4472#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4470#L22-1 havoc main_#t~nondet2; 4468#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4466#L21-4 assume true; 4464#L21-1 assume !!(main_~i~0 < 5); 4462#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4460#L22-1 havoc main_#t~nondet2; 4458#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4456#L21-4 assume true; 4454#L21-1 assume !!(main_~i~0 < 5); 4452#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4450#L22-1 havoc main_#t~nondet2; 4448#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4446#L21-4 assume true; 4444#L21-1 assume !!(main_~i~0 < 5); 4442#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4440#L22-1 havoc main_#t~nondet2; 4438#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4436#L21-4 assume true; 4434#L21-1 assume !(main_~i~0 < 5); 4412#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 4405#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 4392#L25-4 assume true; 4393#L25-1 assume !!(main_~i~0 < 5); 4406#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4407#L26-1 havoc main_#t~nondet5; 4400#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4401#L25-4 assume true; 4473#L25-1 assume !!(main_~i~0 < 5); 4471#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4469#L26-1 havoc main_#t~nondet5; 4467#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4465#L25-4 assume true; 4463#L25-1 assume !!(main_~i~0 < 5); 4461#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4459#L26-1 havoc main_#t~nondet5; 4457#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4455#L25-4 assume true; 4453#L25-1 assume !!(main_~i~0 < 5); 4451#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4449#L26-1 havoc main_#t~nondet5; 4447#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4445#L25-4 assume true; 4443#L25-1 assume !!(main_~i~0 < 5); 4441#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4439#L26-1 havoc main_#t~nondet5; 4437#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4435#L25-4 assume true; 4433#L25-1 assume !(main_~i~0 < 5); 4429#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 4384#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 4385#L30-4 assume true; 4408#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 4416#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4409#L30-4 assume true; 4411#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 4481#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 4480#L30-5 main_~nc_B~0 := 0; 4424#L34-4 assume true; 4403#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 4404#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4489#L34-4 assume true; 4487#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 4485#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 4484#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4483#L43-4 assume true; 4482#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4479#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 4478#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 4427#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4419#L43-4 assume true; 4418#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4399#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 4390#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 4391#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 4426#L43-4 [2018-11-10 04:48:17,436 INFO L795 eck$LassoCheckResult]: Loop: 4426#L43-4 assume true; 4423#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4398#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 4388#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 4389#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4426#L43-4 [2018-11-10 04:48:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -939764662, now seen corresponding path program 2 times [2018-11-10 04:48:17,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-10 04:48:17,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:17,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/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-10 04:48:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:48:17,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:48:17,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:17,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-10 04:48:17,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:17,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-10 04:48:17,594 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:17,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 6 times [2018-11-10 04:48:17,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 04:48:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:48:17,627 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-10 04:48:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:17,730 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-10 04:48:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 04:48:17,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 132 transitions. [2018-11-10 04:48:17,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:17,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 95 states and 99 transitions. [2018-11-10 04:48:17,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-10 04:48:17,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-10 04:48:17,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 99 transitions. [2018-11-10 04:48:17,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:17,733 INFO L705 BuchiCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-10 04:48:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 99 transitions. [2018-11-10 04:48:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-11-10 04:48:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 04:48:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-10 04:48:17,735 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-10 04:48:17,735 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-10 04:48:17,735 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 04:48:17,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 95 transitions. [2018-11-10 04:48:17,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:17,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:17,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:17,737 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 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, 1, 1] [2018-11-10 04:48:17,737 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:17,737 INFO L793 eck$LassoCheckResult]: Stem: 4938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4894#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 4895#L21-4 assume true; 4920#L21-1 assume !!(main_~i~0 < 5); 4935#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4937#L22-1 havoc main_#t~nondet2; 4928#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4929#L21-4 assume true; 4980#L21-1 assume !!(main_~i~0 < 5); 4978#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4976#L22-1 havoc main_#t~nondet2; 4974#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4972#L21-4 assume true; 4970#L21-1 assume !!(main_~i~0 < 5); 4968#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4966#L22-1 havoc main_#t~nondet2; 4964#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4962#L21-4 assume true; 4960#L21-1 assume !!(main_~i~0 < 5); 4958#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4956#L22-1 havoc main_#t~nondet2; 4954#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4952#L21-4 assume true; 4950#L21-1 assume !!(main_~i~0 < 5); 4948#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 4946#L22-1 havoc main_#t~nondet2; 4944#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 4942#L21-4 assume true; 4940#L21-1 assume !(main_~i~0 < 5); 4919#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 4913#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 4900#L25-4 assume true; 4901#L25-1 assume !!(main_~i~0 < 5); 4914#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4915#L26-1 havoc main_#t~nondet5; 4908#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4909#L25-4 assume true; 4979#L25-1 assume !!(main_~i~0 < 5); 4977#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4975#L26-1 havoc main_#t~nondet5; 4973#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4971#L25-4 assume true; 4969#L25-1 assume !!(main_~i~0 < 5); 4967#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4965#L26-1 havoc main_#t~nondet5; 4963#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4961#L25-4 assume true; 4959#L25-1 assume !!(main_~i~0 < 5); 4957#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4955#L26-1 havoc main_#t~nondet5; 4953#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4951#L25-4 assume true; 4949#L25-1 assume !!(main_~i~0 < 5); 4947#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 4945#L26-1 havoc main_#t~nondet5; 4943#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 4941#L25-4 assume true; 4939#L25-1 assume !(main_~i~0 < 5); 4936#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 4892#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 4893#L30-4 assume true; 4916#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 4923#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4917#L30-4 assume true; 4918#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 4932#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 4982#L30-4 assume true; 4931#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 4921#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 4922#L30-5 main_~nc_B~0 := 0; 4933#L34-4 assume true; 4934#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 4904#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4905#L34-4 assume true; 4911#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 4912#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 4981#L34-4 assume true; 4910#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 4902#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 4903#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4930#L43-4 assume true; 4927#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4907#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 4898#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 4899#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 4924#L43-4 [2018-11-10 04:48:17,737 INFO L795 eck$LassoCheckResult]: Loop: 4924#L43-4 assume true; 4925#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 4906#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 4896#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 4897#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 4924#L43-4 [2018-11-10 04:48:17,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1170111563, now seen corresponding path program 3 times [2018-11-10 04:48:17,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 108976505, now seen corresponding path program 7 times [2018-11-10 04:48:17,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1095468177, now seen corresponding path program 3 times [2018-11-10 04:48:17,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:21,075 WARN L179 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 318 DAG size of output: 237 [2018-11-10 04:48:21,196 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 04:48:21,197 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:21,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:21,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:21,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:21,198 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:21,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:21,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:21,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:21,198 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration16_Lasso [2018-11-10 04:48:21,198 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:21,198 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:21,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,498 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-11-10 04:48: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-10 04:48:21,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,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-10 04:48:21,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:21,922 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:21,922 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:21,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:21,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,948 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:21,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,950 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-10 04:48:21,950 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 04:48:21,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,954 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-11-10 04:48:21,954 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 04:48:21,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:21,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:21,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:21,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,991 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:21,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,992 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:21,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:21,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:21,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:21,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:21,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:21,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:21,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:21,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:21,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:22,019 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:22,039 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 04:48:22,039 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 04:48:22,040 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:22,040 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:22,040 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:22,040 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~#string_B~0.offset + 1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 04:48:22,301 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2018-11-10 04:48:22,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:22,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:22,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:22,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:48:22,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 04:48:22,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 99 states and 105 transitions. Complement of second has 8 states. [2018-11-10 04:48:22,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 04:48:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:48:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-10 04:48:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 85 letters. Loop has 5 letters. [2018-11-10 04:48:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 90 letters. Loop has 5 letters. [2018-11-10 04:48:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 85 letters. Loop has 10 letters. [2018-11-10 04:48:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:22,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 105 transitions. [2018-11-10 04:48:22,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:22,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 105 transitions. [2018-11-10 04:48:22,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-10 04:48:22,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 04:48:22,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 105 transitions. [2018-11-10 04:48:22,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:22,387 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-10 04:48:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 105 transitions. [2018-11-10 04:48:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-10 04:48:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 04:48:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-11-10 04:48:22,388 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-11-10 04:48:22,388 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-11-10 04:48:22,389 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 04:48:22,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 104 transitions. [2018-11-10 04:48:22,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:22,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:22,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:22,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:22,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:22,398 INFO L793 eck$LassoCheckResult]: Stem: 5548#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5501#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 5502#L21-4 assume true; 5526#L21-1 assume !!(main_~i~0 < 5); 5545#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 5547#L22-1 havoc main_#t~nondet2; 5535#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5536#L21-4 assume true; 5592#L21-1 assume !!(main_~i~0 < 5); 5591#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 5589#L22-1 havoc main_#t~nondet2; 5587#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5585#L21-4 assume true; 5583#L21-1 assume !!(main_~i~0 < 5); 5581#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 5579#L22-1 havoc main_#t~nondet2; 5577#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5575#L21-4 assume true; 5573#L21-1 assume !!(main_~i~0 < 5); 5571#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 5569#L22-1 havoc main_#t~nondet2; 5567#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5564#L21-4 assume true; 5562#L21-1 assume !!(main_~i~0 < 5); 5560#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 5558#L22-1 havoc main_#t~nondet2; 5555#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 5552#L21-4 assume true; 5550#L21-1 assume !(main_~i~0 < 5); 5525#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 5519#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 5507#L25-4 assume true; 5508#L25-1 assume !!(main_~i~0 < 5); 5520#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 5521#L26-1 havoc main_#t~nondet5; 5515#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5516#L25-4 assume true; 5590#L25-1 assume !!(main_~i~0 < 5); 5588#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 5586#L26-1 havoc main_#t~nondet5; 5584#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5582#L25-4 assume true; 5580#L25-1 assume !!(main_~i~0 < 5); 5578#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 5576#L26-1 havoc main_#t~nondet5; 5574#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5572#L25-4 assume true; 5570#L25-1 assume !!(main_~i~0 < 5); 5568#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 5566#L26-1 havoc main_#t~nondet5; 5565#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5563#L25-4 assume true; 5561#L25-1 assume !!(main_~i~0 < 5); 5559#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 5557#L26-1 havoc main_#t~nondet5; 5554#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 5551#L25-4 assume true; 5549#L25-1 assume !(main_~i~0 < 5); 5546#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 5499#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 5500#L30-4 assume true; 5522#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 5593#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 5523#L30-4 assume true; 5524#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 5529#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 5530#L30-4 assume true; 5537#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 5527#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 5528#L30-5 main_~nc_B~0 := 0; 5540#L34-4 assume true; 5518#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 5511#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 5512#L34-4 assume true; 5541#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 5556#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 5553#L34-4 assume true; 5517#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 5509#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 5510#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5531#L43-4 assume true; 5532#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 5514#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 5505#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 5506#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 5544#L43-4 assume true; 5538#L41-1 [2018-11-10 04:48:22,399 INFO L795 eck$LassoCheckResult]: Loop: 5538#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 5513#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 5503#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 5504#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 5542#L43-4 assume true; 5538#L41-1 [2018-11-10 04:48:22,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1913720169, now seen corresponding path program 4 times [2018-11-10 04:48:22,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:22,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:22,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:22,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 1 times [2018-11-10 04:48:22,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:22,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:22,440 INFO L82 PathProgramCache]: Analyzing trace with hash 400224903, now seen corresponding path program 5 times [2018-11-10 04:48:22,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:22,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:27,224 WARN L179 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 318 DAG size of output: 239 [2018-11-10 04:48:27,390 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 04:48:27,392 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:27,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:27,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:27,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:27,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:27,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:27,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:27,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:27,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-10 04:48:27,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:27,393 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:27,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:27,753 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-11-10 04:48:28,104 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:28,105 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:28,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:28,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:28,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:28,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,145 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:28,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,146 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:28,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,147 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:28,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,148 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:28,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,151 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 04:48:28,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,152 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 04:48:28,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,165 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:48:28,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:48:28,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:28,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:28,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:28,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:28,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:28,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:28,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:28,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:28,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:28,210 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-10 04:48:28,210 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 04:48:28,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:28,211 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:28,211 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:28,211 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#string_A~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#string_A~0.offset Supporting invariants [] [2018-11-10 04:48:28,534 INFO L297 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2018-11-10 04:48:28,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:48:28,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:28,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:28,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:28,618 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 04:48:28,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 104 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 04:48:28,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 104 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 124 states and 135 transitions. Complement of second has 9 states. [2018-11-10 04:48:28,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:48:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 04:48:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-10 04:48:28,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 86 letters. Loop has 5 letters. [2018-11-10 04:48:28,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:28,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 91 letters. Loop has 5 letters. [2018-11-10 04:48:28,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:28,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 86 letters. Loop has 10 letters. [2018-11-10 04:48:28,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:28,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 135 transitions. [2018-11-10 04:48:28,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:28,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 115 states and 124 transitions. [2018-11-10 04:48:28,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-10 04:48:28,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 04:48:28,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 124 transitions. [2018-11-10 04:48:28,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:28,676 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-10 04:48:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 124 transitions. [2018-11-10 04:48:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-10 04:48:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 04:48:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-10 04:48:28,677 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-10 04:48:28,677 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-10 04:48:28,678 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 04:48:28,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 124 transitions. [2018-11-10 04:48:28,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:28,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:28,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:28,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:28,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:28,680 INFO L793 eck$LassoCheckResult]: Stem: 6212#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6164#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 6165#L21-4 assume true; 6190#L21-1 assume !!(main_~i~0 < 5); 6209#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6211#L22-1 havoc main_#t~nondet2; 6199#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6200#L21-4 assume true; 6254#L21-1 assume !!(main_~i~0 < 5); 6253#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6252#L22-1 havoc main_#t~nondet2; 6251#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6249#L21-4 assume true; 6247#L21-1 assume !!(main_~i~0 < 5); 6245#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6243#L22-1 havoc main_#t~nondet2; 6241#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6239#L21-4 assume true; 6237#L21-1 assume !!(main_~i~0 < 5); 6235#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6233#L22-1 havoc main_#t~nondet2; 6231#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6229#L21-4 assume true; 6227#L21-1 assume !!(main_~i~0 < 5); 6225#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6223#L22-1 havoc main_#t~nondet2; 6220#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6217#L21-4 assume true; 6215#L21-1 assume !(main_~i~0 < 5); 6189#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 6182#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 6183#L25-4 assume true; 6263#L25-1 assume !!(main_~i~0 < 5); 6262#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6213#L26-1 havoc main_#t~nondet5; 6179#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6170#L25-4 assume true; 6171#L25-1 assume !!(main_~i~0 < 5); 6184#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6185#L26-1 havoc main_#t~nondet5; 6250#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6248#L25-4 assume true; 6246#L25-1 assume !!(main_~i~0 < 5); 6244#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6242#L26-1 havoc main_#t~nondet5; 6240#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6238#L25-4 assume true; 6236#L25-1 assume !!(main_~i~0 < 5); 6234#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6232#L26-1 havoc main_#t~nondet5; 6230#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6228#L25-4 assume true; 6226#L25-1 assume !!(main_~i~0 < 5); 6224#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6222#L26-1 havoc main_#t~nondet5; 6219#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6216#L25-4 assume true; 6214#L25-1 assume !(main_~i~0 < 5); 6210#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 6162#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 6163#L30-4 assume true; 6186#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6193#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6187#L30-4 assume true; 6188#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6256#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6255#L30-4 assume true; 6201#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6191#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 6192#L30-5 main_~nc_B~0 := 0; 6205#L34-4 assume true; 6181#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6174#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6175#L34-4 assume true; 6206#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6221#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6218#L34-4 assume true; 6180#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6172#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 6173#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6202#L43-4 assume true; 6260#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6177#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6178#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6272#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 6267#L43-4 assume true; 6271#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6270#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6269#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6266#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6268#L43-4 assume true; 6203#L41-1 [2018-11-10 04:48:28,680 INFO L795 eck$LassoCheckResult]: Loop: 6203#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6176#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6166#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6167#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6207#L43-4 assume true; 6203#L41-1 [2018-11-10 04:48:28,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2119735031, now seen corresponding path program 4 times [2018-11-10 04:48:28,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:28,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:28,714 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 2 times [2018-11-10 04:48:28,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:28,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:28,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1341334809, now seen corresponding path program 5 times [2018-11-10 04:48:28,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:28,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 04:48:28,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:28,783 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:48:28,803 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 04:48:28,896 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 04:48:28,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:28,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 04:48:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-11-10 04:48:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 04:48:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-10 04:48:29,054 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. cyclomatic complexity: 15 Second operand 16 states. [2018-11-10 04:48:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:29,201 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-11-10 04:48:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 04:48:29,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 189 transitions. [2018-11-10 04:48:29,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:29,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 120 states and 129 transitions. [2018-11-10 04:48:29,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 04:48:29,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 04:48:29,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 129 transitions. [2018-11-10 04:48:29,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:29,203 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-11-10 04:48:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 129 transitions. [2018-11-10 04:48:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-10 04:48:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 04:48:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-11-10 04:48:29,205 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-10 04:48:29,205 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-10 04:48:29,205 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 04:48:29,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 127 transitions. [2018-11-10 04:48:29,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:29,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:29,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:29,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:29,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:29,207 INFO L793 eck$LassoCheckResult]: Stem: 6826#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6776#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 6777#L21-4 assume true; 6803#L21-1 assume !!(main_~i~0 < 5); 6823#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6825#L22-1 havoc main_#t~nondet2; 6812#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6813#L21-4 assume true; 6868#L21-1 assume !!(main_~i~0 < 5); 6867#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6865#L22-1 havoc main_#t~nondet2; 6863#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6861#L21-4 assume true; 6859#L21-1 assume !!(main_~i~0 < 5); 6857#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6855#L22-1 havoc main_#t~nondet2; 6853#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6851#L21-4 assume true; 6849#L21-1 assume !!(main_~i~0 < 5); 6847#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6845#L22-1 havoc main_#t~nondet2; 6843#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6841#L21-4 assume true; 6839#L21-1 assume !!(main_~i~0 < 5); 6837#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 6835#L22-1 havoc main_#t~nondet2; 6832#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 6829#L21-4 assume true; 6827#L21-1 assume !(main_~i~0 < 5); 6802#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 6794#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 6795#L25-4 assume true; 6869#L25-1 assume !!(main_~i~0 < 5); 6800#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6801#L26-1 havoc main_#t~nondet5; 6791#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6782#L25-4 assume true; 6783#L25-1 assume !!(main_~i~0 < 5); 6796#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6866#L26-1 havoc main_#t~nondet5; 6864#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6862#L25-4 assume true; 6860#L25-1 assume !!(main_~i~0 < 5); 6858#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6856#L26-1 havoc main_#t~nondet5; 6854#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6852#L25-4 assume true; 6850#L25-1 assume !!(main_~i~0 < 5); 6848#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6846#L26-1 havoc main_#t~nondet5; 6844#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6842#L25-4 assume true; 6840#L25-1 assume !!(main_~i~0 < 5); 6838#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 6836#L26-1 havoc main_#t~nondet5; 6833#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 6830#L25-4 assume true; 6828#L25-1 assume !(main_~i~0 < 5); 6824#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 6774#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 6775#L30-4 assume true; 6797#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6891#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6798#L30-4 assume true; 6799#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6806#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6807#L30-4 assume true; 6871#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6872#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 6870#L30-4 assume true; 6814#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 6804#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 6805#L30-5 main_~nc_B~0 := 0; 6818#L34-4 assume true; 6793#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6786#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6787#L34-4 assume true; 6819#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6834#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 6831#L34-4 assume true; 6792#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 6784#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 6785#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6808#L43-4 assume true; 6809#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6789#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6790#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6887#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 6810#L43-4 assume true; 6811#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6882#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6880#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6877#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6878#L43-4 assume true; 6815#L41-1 [2018-11-10 04:48:29,207 INFO L795 eck$LassoCheckResult]: Loop: 6815#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 6788#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 6778#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 6779#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 6873#L43-4 assume true; 6815#L41-1 [2018-11-10 04:48:29,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2133400764, now seen corresponding path program 6 times [2018-11-10 04:48:29,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:29,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-10 04:48:29,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:48:29,300 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17ff3254-f1e6-47a1-aaf4-25bfc3638ccb/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:48:29,310 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 04:48:29,358 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-10 04:48:29,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:48:29,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-10 04:48:29,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:48:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-10 04:48:29,450 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:48:29,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 3 times [2018-11-10 04:48:29,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:48:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-11-10 04:48:29,483 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. cyclomatic complexity: 15 Second operand 17 states. [2018-11-10 04:48:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:48:29,549 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-11-10 04:48:29,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:48:29,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 137 transitions. [2018-11-10 04:48:29,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:29,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 125 states and 134 transitions. [2018-11-10 04:48:29,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 04:48:29,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 04:48:29,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 134 transitions. [2018-11-10 04:48:29,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:48:29,552 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 134 transitions. [2018-11-10 04:48:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 134 transitions. [2018-11-10 04:48:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-11-10 04:48:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-10 04:48:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2018-11-10 04:48:29,554 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-11-10 04:48:29,554 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-11-10 04:48:29,554 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 04:48:29,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 130 transitions. [2018-11-10 04:48:29,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 04:48:29,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:48:29,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:48:29,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:48:29,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:48:29,555 INFO L793 eck$LassoCheckResult]: Stem: 7375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7325#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 5;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 7326#L21-4 assume true; 7420#L21-1 assume !!(main_~i~0 < 5); 7418#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 7374#L22-1 havoc main_#t~nondet2; 7360#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 7350#L21-4 assume true; 7351#L21-1 assume !!(main_~i~0 < 5); 7372#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 7376#L22-1 havoc main_#t~nondet2; 7415#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 7413#L21-4 assume true; 7411#L21-1 assume !!(main_~i~0 < 5); 7409#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 7407#L22-1 havoc main_#t~nondet2; 7405#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 7403#L21-4 assume true; 7401#L21-1 assume !!(main_~i~0 < 5); 7399#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 7397#L22-1 havoc main_#t~nondet2; 7395#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 7393#L21-4 assume true; 7391#L21-1 assume !!(main_~i~0 < 5); 7389#L22 SUMMARY for call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L22 7387#L22-1 havoc main_#t~nondet2; 7384#L21-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 7380#L21-4 assume true; 7378#L21-1 assume !(main_~i~0 < 5); 7349#L21-5 SUMMARY for call main_#t~mem3 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + 4, 1); srcloc: L21-5 7343#L23 assume !!(main_#t~mem3 == 0);havoc main_#t~mem3;main_~i~0 := 0; 7331#L25-4 assume true; 7332#L25-1 assume !!(main_~i~0 < 5); 7344#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 7345#L26-1 havoc main_#t~nondet5; 7339#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 7340#L25-4 assume true; 7419#L25-1 assume !!(main_~i~0 < 5); 7417#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 7416#L26-1 havoc main_#t~nondet5; 7414#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 7412#L25-4 assume true; 7410#L25-1 assume !!(main_~i~0 < 5); 7408#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 7406#L26-1 havoc main_#t~nondet5; 7404#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 7402#L25-4 assume true; 7400#L25-1 assume !!(main_~i~0 < 5); 7398#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 7396#L26-1 havoc main_#t~nondet5; 7394#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 7392#L25-4 assume true; 7390#L25-1 assume !!(main_~i~0 < 5); 7388#L26 SUMMARY for call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0 * 1, 1); srcloc: L26 7386#L26-1 havoc main_#t~nondet5; 7383#L25-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 7379#L25-4 assume true; 7377#L25-1 assume !(main_~i~0 < 5); 7373#L25-5 SUMMARY for call main_#t~mem6 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + 4, 1); srcloc: L25-5 7323#L27 assume !!(main_#t~mem6 == 0);havoc main_#t~mem6;main_~nc_A~0 := 0; 7324#L30-4 assume true; 7346#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 7431#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 7429#L30-4 assume true; 7428#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 7354#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 7347#L30-4 assume true; 7348#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 7362#L30-2 assume !!(main_#t~mem7 != 0);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := main_#t~post8 + 1;havoc main_#t~post8; 7421#L30-4 assume true; 7361#L30-1 SUMMARY for call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0 * 1, 1); srcloc: L30-1 7352#L30-2 assume !(main_#t~mem7 != 0);havoc main_#t~mem7; 7353#L30-5 main_~nc_B~0 := 0; 7367#L34-4 assume true; 7342#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 7335#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 7336#L34-4 assume true; 7368#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 7427#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 7426#L34-4 assume true; 7382#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 7385#L34-2 assume !!(main_#t~mem9 != 0);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := main_#t~post10 + 1;havoc main_#t~post10; 7381#L34-4 assume true; 7341#L34-1 SUMMARY for call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0 * 1, 1); srcloc: L34-1 7333#L34-2 assume !(main_#t~mem9 != 0);havoc main_#t~mem9; 7334#L34-5 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 7363#L43-4 assume true; 7430#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 7337#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 7327#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 7328#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 7355#L43-4 assume true; 7357#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 7425#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 7424#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 7423#L43-2 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := main_~i~0 - main_~j~0 + 1;main_~j~0 := 0; 7422#L43-4 assume true; 7364#L41-1 [2018-11-10 04:48:29,555 INFO L795 eck$LassoCheckResult]: Loop: 7364#L41-1 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0); 7365#L43 SUMMARY for call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0 * 1, 1); srcloc: L43 7432#L43-1 SUMMARY for call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0 * 1, 1); srcloc: L43-1 7369#L43-2 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := main_#t~post13 + 1;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := main_#t~post14 + 1;havoc main_#t~post14; 7370#L43-4 assume true; 7364#L41-1 [2018-11-10 04:48:29,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 93496038, now seen corresponding path program 7 times [2018-11-10 04:48:29,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash 114548463, now seen corresponding path program 4 times [2018-11-10 04:48:29,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:29,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:48:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1537457366, now seen corresponding path program 8 times [2018-11-10 04:48:29,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:48:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:48:29,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:48:29,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:48:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:48:34,384 WARN L179 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 367 DAG size of output: 274 [2018-11-10 04:48:34,646 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 04:48:34,648 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:48:34,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:48:34,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:48:34,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:48:34,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:48:34,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:48:34,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:48:34,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:48:34,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration20_Lasso [2018-11-10 04:48:34,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:48:34,648 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:48:34,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-10 04:48:34,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-10 04:48:34,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-10 04:48:34,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-10 04:48:34,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-10 04:48:34,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:34,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-10 04:48:34,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-10 04:48:34,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-10 04:48:34,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:34,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-10 04:48:34,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:34,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:34,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:34,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:35,135 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2018-11-10 04:48:35,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:35,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:35,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:48:35,688 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-10 04:48:35,729 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:48:35,729 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:48:35,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-10 04:48:35,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:35,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:35,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,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-10 04:48:35,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:35,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:35,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:35,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:35,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:48:35,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:48:35,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:48:35,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:48:35,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:48:35,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:48:35,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:48:35,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:48:35,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:48:35,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:48:35,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:48:35,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:48:35,767 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:48:35,767 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 04:48:35,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:48:35,768 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:48:35,768 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:48:35,768 INFO L519 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-10 04:48:35,992 INFO L297 tatePredicateManager]: 44 out of 44 supporting invariants were superfluous and have been removed [2018-11-10 04:48:35,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:36,044 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:48:36,044 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 04:48:36,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 135 states and 146 transitions. Complement of second has 7 states. [2018-11-10 04:48:36,054 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-10 04:48:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-10 04:48:36,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 97 letters. Loop has 5 letters. [2018-11-10 04:48:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:36,055 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:48:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:36,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:48:36,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 04:48:36,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 135 states and 144 transitions. Complement of second has 7 states. [2018-11-10 04:48:36,124 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-10 04:48:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-10 04:48:36,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 97 letters. Loop has 5 letters. [2018-11-10 04:48:36,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:36,125 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:48:36,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:48:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:48:36,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:48:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:48:36,174 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 04:48:36,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 04:48:36,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 130 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 155 states and 171 transitions. Complement of second has 6 states. [2018-11-10 04:48:36,182 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-10 04:48:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:48:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-10 04:48:36,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 97 letters. Loop has 5 letters. [2018-11-10 04:48:36,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:36,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 102 letters. Loop has 5 letters. [2018-11-10 04:48:36,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:36,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 97 letters. Loop has 10 letters. [2018-11-10 04:48:36,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:48:36,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 171 transitions. [2018-11-10 04:48:36,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:48:36,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:48:36,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:48:36,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:48:36,185 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 04:48:36,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:48:36,185 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:48:36,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:48:36,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:48:36 BoogieIcfgContainer [2018-11-10 04:48:36,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:48:36,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:48:36,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:48:36,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:48:36,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:48:02" (3/4) ... [2018-11-10 04:48:36,195 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:48:36,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:48:36,195 INFO L168 Benchmark]: Toolchain (without parser) took 34409.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 954.8 MB in the beginning and 1.0 GB in the end (delta: -86.5 MB). Peak memory consumption was 396.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,196 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:48:36,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.65 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.21 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,197 INFO L168 Benchmark]: Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,197 INFO L168 Benchmark]: RCFGBuilder took 306.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,198 INFO L168 Benchmark]: BuchiAutomizer took 33844.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 417.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:48:36,198 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:48:36,201 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.65 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.21 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.0 GB. Free memory was 941.4 MB in the beginning and 938.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 306.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 33844.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.7 MB). Peak memory consumption was 417.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (13 trivial, 6 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 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 -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * i and consists of 7 locations. One deterministic module has affine ranking function string_B + j + nc_A + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * i + -1 * string_A and consists of 6 locations. One nondeterministic module has affine ranking function nc_A + -1 * i and consists of 4 locations. 13 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.8s and 21 iterations. TraceHistogramMax:6. Analysis of lassos took 31.9s. Construction of modules took 0.6s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 18. Automata minimization 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 181 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 121 states and ocurred in iteration 19. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 608 SDtfs, 986 SDslu, 1165 SDs, 0 SdLazy, 1166 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU9 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital300 mio100 ax100 hnf99 lsp95 ukn57 mio100 lsp49 div100 bol100 ite100 ukn100 eq181 hnf84 smp96 dnf140 smp95 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms 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...