./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-aa41828 [2018-11-22 22:23:45,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:23:45,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:23:45,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:23:45,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:23:45,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:23:45,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:23:45,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:23:45,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:23:45,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:23:45,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:23:45,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:23:45,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:23:45,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:23:45,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:23:45,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:23:45,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:23:45,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:23:45,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:23:45,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:23:45,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:23:45,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:23:45,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:23:45,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:23:45,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:23:45,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:23:45,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:23:45,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:23:45,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:23:45,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:23:45,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:23:45,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:23:45,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:23:45,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:23:45,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:23:45,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:23:45,143 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:23:45,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:23:45,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:23:45,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:23:45,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:23:45,154 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:23:45,154 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:23:45,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:23:45,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:23:45,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:23:45,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:23:45,157 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:23:45,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:23:45,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:23:45,157 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:23:45,158 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:23:45,158 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_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:45,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:23:45,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:23:45,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:23:45,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:23:45,195 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:23:45,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-22 22:23:45,242 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/data/500ef32a7/f55c560804cc4c4383e9be4a52bb4641/FLAG5a74e1205 [2018-11-22 22:23:45,647 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:23:45,647 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/sv-benchmarks/c/loops/string_false-unreach-call_true-termination.i [2018-11-22 22:23:45,651 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/data/500ef32a7/f55c560804cc4c4383e9be4a52bb4641/FLAG5a74e1205 [2018-11-22 22:23:45,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/bin-2019/uautomizer/data/500ef32a7/f55c560804cc4c4383e9be4a52bb4641 [2018-11-22 22:23:45,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:23:45,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:23:45,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:23:45,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:23:45,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:23:45,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab0a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45, skipping insertion in model container [2018-11-22 22:23:45,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:23:45,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:23:45,812 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:23:45,814 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:23:45,830 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:23:45,844 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:23:45,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45 WrapperNode [2018-11-22 22:23:45,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:23:45,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:23:45,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:23:45,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:23:45,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:23:45,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:23:45,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:23:45,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:23:45,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... [2018-11-22 22:23:45,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:23:45,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:23:45,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:23:45,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:23:45,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:23:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:23:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:23:45,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:23:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:23:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:23:46,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:23:46,134 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-22 22:23:46,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:46 BoogieIcfgContainer [2018-11-22 22:23:46,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:23:46,134 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:23:46,134 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:23:46,137 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:23:46,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:23:46,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:23:45" (1/3) ... [2018-11-22 22:23:46,139 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1595acc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:23:46, skipping insertion in model container [2018-11-22 22:23:46,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:23:46,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:23:45" (2/3) ... [2018-11-22 22:23:46,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1595acc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:23:46, skipping insertion in model container [2018-11-22 22:23:46,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:23:46,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:46" (3/3) ... [2018-11-22 22:23:46,141 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-22 22:23:46,180 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:23:46,180 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:23:46,180 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:23:46,181 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:23:46,181 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:23:46,181 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:23:46,181 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:23:46,181 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:23:46,181 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:23:46,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 22:23:46,207 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-22 22:23:46,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:46,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:46,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:23:46,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:46,211 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:23:46,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 22:23:46,213 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-22 22:23:46,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:46,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:46,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:23:46,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:46,219 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 22#L21-3true [2018-11-22 22:23:46,219 INFO L796 eck$LassoCheckResult]: Loop: 22#L21-3true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 24#L21-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 22#L21-3true [2018-11-22 22:23:46,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 22:23:46,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:46,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:46,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-22 22:23:46,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:46,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:46,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-22 22:23:46,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:46,503 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:23:46,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:23:46,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:23:46,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:23:46,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:23:46,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:23:46,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:23:46,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:23:46,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-22 22:23:46,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:23:46,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:23:46,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:46,815 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:23:46,818 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:23:46,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-22 22:23:46,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,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-22 22:23:46,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:46,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:46,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,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-22 22:23:46,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:46,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:46,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:46,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:46,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:46,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:46,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:46,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:46,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:46,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:46,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:46,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:46,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:46,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:46,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:46,918 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:23:46,944 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-22 22:23:46,944 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:23:46,946 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:23:46,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:23:46,947 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:23:46,947 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1, ULTIMATE.start_main_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:23:46,952 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:23:46,957 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:23:46,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:46,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,021 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-22 22:23:47,030 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-22 22:23:47,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-22 22:23:47,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 50 states and 80 transitions. Complement of second has 8 states. [2018-11-22 22:23:47,078 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-22 22:23:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:23:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-22 22:23:47,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-22 22:23:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-22 22:23:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-22 22:23:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:47,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-11-22 22:23:47,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-11-22 22:23:47,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:23:47,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 22:23:47,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-11-22 22:23:47,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,088 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-22 22:23:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-11-22 22:23:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-22 22:23:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 22:23:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-11-22 22:23:47,105 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-22 22:23:47,105 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-22 22:23:47,105 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:23:47,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-11-22 22:23:47,106 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:23:47,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,107 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 134#L21-3 assume !(main_~i~0 < 5); 132#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 133#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 144#L25-3 [2018-11-22 22:23:47,107 INFO L796 eck$LassoCheckResult]: Loop: 144#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 145#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 144#L25-3 [2018-11-22 22:23:47,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-11-22 22:23:47,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,137 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-22 22:23:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:23:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:23:47,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:47,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-22 22:23:47,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:23:47,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:23:47,176 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-22 22:23:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:47,198 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-22 22:23:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:23:47,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-22 22:23:47,199 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-11-22 22:23:47,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-22 22:23:47,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-22 22:23:47,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-22 22:23:47,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,201 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-22 22:23:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-22 22:23:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-22 22:23:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:23:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-22 22:23:47,203 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-22 22:23:47,203 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-22 22:23:47,203 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:23:47,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-22 22:23:47,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:47,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,205 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 183#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 184#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 185#L21-3 assume !(main_~i~0 < 5); 181#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 182#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 193#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 194#L25-2 [2018-11-22 22:23:47,205 INFO L796 eck$LassoCheckResult]: Loop: 194#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 195#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 194#L25-2 [2018-11-22 22:23:47,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-11-22 22:23:47,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:23:47,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:47,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:23:47,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:23:47,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-22 22:23:47,265 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:47,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-11-22 22:23:47,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:23:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:23:47,306 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-22 22:23:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:47,341 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-22 22:23:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:23:47,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-22 22:23:47,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-22 22:23:47,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-22 22:23:47,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-22 22:23:47,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-22 22:23:47,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,344 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-22 22:23:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-22 22:23:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-22 22:23:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:23:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-22 22:23:47,346 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-22 22:23:47,346 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-22 22:23:47,346 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:23:47,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-22 22:23:47,347 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:47,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,349 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 262#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 263#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 264#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 265#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 277#L21-3 assume !(main_~i~0 < 5); 260#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 261#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 275#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 276#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 273#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 274#L25-2 [2018-11-22 22:23:47,349 INFO L796 eck$LassoCheckResult]: Loop: 274#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 278#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 274#L25-2 [2018-11-22 22:23:47,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-11-22 22:23:47,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:23:47,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:47,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:23:47,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:23:47,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-22 22:23:47,447 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:47,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-11-22 22:23:47,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:47,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:23:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:23:47,515 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-22 22:23:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:47,559 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-22 22:23:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:23:47,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-22 22:23:47,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 22:23:47,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-22 22:23:47,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-22 22:23:47,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-11-22 22:23:47,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,562 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 22:23:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-11-22 22:23:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-11-22 22:23:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:23:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-22 22:23:47,564 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-22 22:23:47,564 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-22 22:23:47,565 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:23:47,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-22 22:23:47,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-22 22:23:47,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,566 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 364#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 365#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 368#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 383#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 366#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 367#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 381#L21-3 assume !(main_~i~0 < 5); 362#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 363#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 378#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 379#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 380#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 384#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 376#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 377#L25-2 [2018-11-22 22:23:47,566 INFO L796 eck$LassoCheckResult]: Loop: 377#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 377#L25-2 [2018-11-22 22:23:47,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-11-22 22:23:47,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:23:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:47,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:23:47,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:23:47,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:23:47,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:23:47,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:23:47,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-22 22:23:47,674 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:47,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-11-22 22:23:47,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:23:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:23:47,698 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-22 22:23:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:47,749 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-22 22:23:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:23:47,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-11-22 22:23:47,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-11-22 22:23:47,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-22 22:23:47,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-22 22:23:47,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-11-22 22:23:47,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,751 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-22 22:23:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-11-22 22:23:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-22 22:23:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 22:23:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-22 22:23:47,753 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-22 22:23:47,753 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-22 22:23:47,753 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:23:47,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-22 22:23:47,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-11-22 22:23:47,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,755 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 489#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 490#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 491#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 492#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 509#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 508#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 507#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 504#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 503#L21-3 assume !(main_~i~0 < 5); 487#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 488#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 500#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 501#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 502#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 513#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 512#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 511#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 510#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 506#L25-2 [2018-11-22 22:23:47,755 INFO L796 eck$LassoCheckResult]: Loop: 506#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 505#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 506#L25-2 [2018-11-22 22:23:47,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-11-22 22:23:47,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 22:23:47,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:47,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:23:47,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 22:23:47,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:23:47,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 22:23:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:23:47,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-22 22:23:47,885 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:47,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-11-22 22:23:47,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:23:47,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:23:47,928 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-22 22:23:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:47,985 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-22 22:23:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:23:47,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-22 22:23:47,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-22 22:23:47,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-22 22:23:47,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-22 22:23:47,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-22 22:23:47,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:47,987 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-22 22:23:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-22 22:23:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-11-22 22:23:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:23:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-22 22:23:47,988 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-22 22:23:47,989 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-22 22:23:47,989 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:23:47,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-22 22:23:47,990 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 22:23:47,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:47,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:47,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-11-22 22:23:47,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:47,991 INFO L794 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 642#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 635#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 636#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 637#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 638#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 660#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 658#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 656#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 655#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 652#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 651#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 650#L21-3 assume !(main_~i~0 < 5); 633#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 634#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 648#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 649#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 646#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 647#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 663#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 662#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 661#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 659#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 657#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 654#L25-2 [2018-11-22 22:23:47,991 INFO L796 eck$LassoCheckResult]: Loop: 654#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 653#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 654#L25-2 [2018-11-22 22:23:47,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-11-22 22:23:47,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:47,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:47,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:47,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-11-22 22:23:48,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-11-22 22:23:48,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:48,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:48,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:48,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-22 22:23:48,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:23:48,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:23:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:23:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:23:48,183 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-22 22:23:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:48,233 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-22 22:23:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:23:48,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-22 22:23:48,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 22:23:48,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-11-22 22:23:48,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-22 22:23:48,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:23:48,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-11-22 22:23:48,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:23:48,235 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-22 22:23:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-11-22 22:23:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-22 22:23:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 22:23:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-22 22:23:48,237 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-22 22:23:48,237 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-22 22:23:48,237 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:23:48,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-11-22 22:23:48,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 22:23:48,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:48,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:48,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:48,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:48,239 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 722#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 723#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 724#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 725#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 726#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 750#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 749#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 748#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 747#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 738#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 737#L21-3 assume !(main_~i~0 < 5); 720#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 721#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 734#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 735#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 736#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 746#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 745#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 744#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 743#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 742#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 741#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 740#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 739#L25-3 assume !(main_~i~0 < 5); 732#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 717#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 718#L30-3 [2018-11-22 22:23:48,239 INFO L796 eck$LassoCheckResult]: Loop: 718#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 719#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 718#L30-3 [2018-11-22 22:23:48,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-11-22 22:23:48,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:48,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:48,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-11-22 22:23:48,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-11-22 22:23:48,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:48,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:50,847 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-11-22 22:23:50,931 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:23:50,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:23:50,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:23:50,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:23:50,931 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:23:50,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:23:50,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:23:50,931 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:23:50,931 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-22 22:23:50,931 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:23:50,931 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:23:50,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:51,170 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:23:51,170 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:23:51,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:51,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:51,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:51,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:51,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:51,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:51,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:51,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:51,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:51,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:51,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:51,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:51,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:51,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:51,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:51,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:51,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:51,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:51,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:51,219 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:23:51,229 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:23:51,229 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 22:23:51,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:23:51,230 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:23:51,230 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:23:51,230 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-22 22:23:51,284 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-22 22:23:51,285 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:23:51,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:51,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:51,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:51,335 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-22 22:23:51,336 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-22 22:23:51,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-22 22:23:51,350 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-22 22:23:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:23:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:23:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-22 22:23:51,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-11-22 22:23:51,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-11-22 22:23:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-22 22:23:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:51,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-22 22:23:51,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:23:51,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-11-22 22:23:51,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-22 22:23:51,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:23:51,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-22 22:23:51,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:51,354 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 22:23:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-22 22:23:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-22 22:23:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 22:23:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-22 22:23:51,356 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 22:23:51,356 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 22:23:51,356 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 22:23:51,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-22 22:23:51,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:23:51,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:51,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:51,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:51,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:51,357 INFO L794 eck$LassoCheckResult]: Stem: 976#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 973#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 966#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 967#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 968#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 969#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 994#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 993#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 992#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 991#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 990#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 987#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 986#L21-3 assume !(main_~i~0 < 5); 964#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 965#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 979#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 980#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 977#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 978#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 989#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 988#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 985#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 984#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 983#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 982#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 981#L25-3 assume !(main_~i~0 < 5); 975#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 959#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 960#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 962#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 957#L30-4 main_~nc_B~0 := 0; 958#L34-3 [2018-11-22 22:23:51,357 INFO L796 eck$LassoCheckResult]: Loop: 958#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 974#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 958#L34-3 [2018-11-22 22:23:51,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-11-22 22:23:51,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:51,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:51,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:51,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-11-22 22:23:51,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:51,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:51,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:51,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-11-22 22:23:51,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:51,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:53,630 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 224 DAG size of output: 166 [2018-11-22 22:23:53,708 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:23:53,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:23:53,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:23:53,709 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:23:53,709 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:23:53,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:23:53,709 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:23:53,709 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:23:53,709 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-22 22:23:53,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:23:53,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:23:53,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:53,896 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:23:53,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:23:53,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:53,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:53,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:53,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:53,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:53,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:53,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:53,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:53,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,929 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:23:53,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,930 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:23:53,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:53,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-22 22:23:53,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:53,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:53,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:53,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:53,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:53,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:53,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:23:53,954 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-22 22:23:53,954 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-22 22:23:53,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:23:53,955 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 22:23:53,956 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:23:53,956 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3) = -1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [1*ULTIMATE.start_main_~#string_B~0.offset >= 0] [2018-11-22 22:23:54,001 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-11-22 22:23:54,005 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:23:54,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:54,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:54,071 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-22 22:23:54,072 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:23:54,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-22 22:23:54,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 51 transitions. Complement of second has 5 states. [2018-11-22 22:23:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:23:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:23:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-22 22:23:54,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-11-22 22:23:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:54,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-11-22 22:23:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:54,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-22 22:23:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:54,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-11-22 22:23:54,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-11-22 22:23:54,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-22 22:23:54,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:23:54,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-11-22 22:23:54,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:54,099 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-22 22:23:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-11-22 22:23:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-22 22:23:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:23:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-22 22:23:54,101 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-22 22:23:54,101 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-22 22:23:54,101 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 22:23:54,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-11-22 22:23:54,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:54,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:54,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:54,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:54,103 INFO L794 eck$LassoCheckResult]: Stem: 1205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1203#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1193#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1194#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1195#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1196#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1223#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1222#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1221#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1220#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1219#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1216#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1215#L21-3 assume !(main_~i~0 < 5); 1191#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1192#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1209#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1208#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1206#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1207#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1218#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1217#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1214#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1213#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1212#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1211#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1210#L25-3 assume !(main_~i~0 < 5); 1204#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1186#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1187#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1189#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1184#L30-4 main_~nc_B~0 := 0; 1185#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1201#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1197#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1198#L43-2 [2018-11-22 22:23:54,103 INFO L796 eck$LassoCheckResult]: Loop: 1198#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1199#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1198#L43-2 [2018-11-22 22:23:54,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-11-22 22:23:54,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-11-22 22:23:54,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-11-22 22:23:54,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-22 22:23:54,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:23:54,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:23:54,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:23:54,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:23:54,236 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-22 22:23:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:54,276 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-22 22:23:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:23:54,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-22 22:23:54,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-11-22 22:23:54,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-22 22:23:54,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:23:54,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-22 22:23:54,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:54,278 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-22 22:23:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-22 22:23:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-22 22:23:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:23:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-22 22:23:54,280 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-22 22:23:54,280 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-22 22:23:54,280 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 22:23:54,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-11-22 22:23:54,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:54,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:54,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:54,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:54,282 INFO L794 eck$LassoCheckResult]: Stem: 1303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1298#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1291#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1292#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1293#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1294#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1321#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1320#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1318#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1316#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1314#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1311#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1310#L21-3 assume !(main_~i~0 < 5); 1289#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1290#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1304#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1305#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1306#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1319#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1317#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1315#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1313#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1312#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1309#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1308#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1307#L25-3 assume !(main_~i~0 < 5); 1302#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1284#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1285#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1286#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1287#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1288#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1282#L30-4 main_~nc_B~0 := 0; 1283#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1300#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1295#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1296#L43-2 [2018-11-22 22:23:54,282 INFO L796 eck$LassoCheckResult]: Loop: 1296#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1297#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1296#L43-2 [2018-11-22 22:23:54,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-11-22 22:23:54,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-22 22:23:54,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:54,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:54,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-22 22:23:54,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:23:54,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-22 22:23:54,499 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:23:54,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-11-22 22:23:54,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:23:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:23:54,534 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-22 22:23:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:54,559 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-22 22:23:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:23:54,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-11-22 22:23:54,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-11-22 22:23:54,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-22 22:23:54,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:23:54,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-22 22:23:54,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:54,560 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-22 22:23:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-22 22:23:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-22 22:23:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 22:23:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-22 22:23:54,561 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-22 22:23:54,562 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-22 22:23:54,562 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 22:23:54,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-11-22 22:23:54,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:54,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:54,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:54,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:54,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:54,562 INFO L794 eck$LassoCheckResult]: Stem: 1506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1504#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1494#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1495#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1496#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1497#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1524#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1523#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1521#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1519#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1517#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1513#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1512#L21-3 assume !(main_~i~0 < 5); 1492#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1493#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1507#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1508#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1509#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1522#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1520#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1518#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1516#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1515#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1514#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1511#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1510#L25-3 assume !(main_~i~0 < 5); 1505#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1487#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1488#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1489#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1490#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1491#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1485#L30-4 main_~nc_B~0 := 0; 1486#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1501#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1502#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1503#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1498#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1499#L43-2 [2018-11-22 22:23:54,562 INFO L796 eck$LassoCheckResult]: Loop: 1499#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1500#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1499#L43-2 [2018-11-22 22:23:54,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-11-22 22:23:54,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,587 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-11-22 22:23:54,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-11-22 22:23:54,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:54,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:54,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:54,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:57,276 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2018-11-22 22:23:57,422 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-22 22:23:57,424 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:23:57,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:23:57,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:23:57,424 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:23:57,424 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:23:57,424 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:23:57,424 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:23:57,424 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:23:57,424 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-22 22:23:57,424 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:23:57,424 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:23:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:23:57,909 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:23:57,909 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:23:57,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-22 22:23:57,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:57,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:57,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:57,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:57,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:57,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:57,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:57,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:23:57,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:23:57,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:23:57,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:23:57,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:23:57,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-22 22:23:57,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:23:57,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:23:57,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:23:57,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:23:57,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:23:57,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:23:57,955 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:23:57,974 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-22 22:23:57,974 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-22 22:23:57,975 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:23:57,975 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:23:57,976 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:23:57,976 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#string_A~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#string_A~0.offset Supporting invariants [] [2018-11-22 22:23:58,056 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-22 22:23:58,057 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:23:58,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:58,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:58,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:58,112 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-22 22:23:58,112 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-22 22:23:58,112 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-22 22:23:58,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2018-11-22 22:23:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:23:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:23:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-22 22:23:58,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-22 22:23:58,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:58,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2018-11-22 22:23:58,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:58,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2018-11-22 22:23:58,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:23:58,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-11-22 22:23:58,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:58,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2018-11-22 22:23:58,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-22 22:23:58,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 22:23:58,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-11-22 22:23:58,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:58,124 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-22 22:23:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-11-22 22:23:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-22 22:23:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 22:23:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-22 22:23:58,126 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-22 22:23:58,126 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-22 22:23:58,126 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 22:23:58,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-22 22:23:58,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:58,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:58,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:58,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:58,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:58,127 INFO L794 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1793#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1779#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1780#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1781#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1782#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1813#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1812#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1811#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1809#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1807#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1802#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1801#L21-3 assume !(main_~i~0 < 5); 1777#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1778#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1796#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1797#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1798#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1810#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1808#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1806#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1805#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1804#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1803#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1800#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1799#L25-3 assume !(main_~i~0 < 5); 1794#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1772#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1773#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1774#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1775#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1776#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1770#L30-4 main_~nc_B~0 := 0; 1771#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1790#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1791#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1792#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1783#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1784#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1789#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1785#L43-2 [2018-11-22 22:23:58,127 INFO L796 eck$LassoCheckResult]: Loop: 1785#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1786#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1785#L43-2 [2018-11-22 22:23:58,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-11-22 22:23:58,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-11-22 22:23:58,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-11-22 22:23:58,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-22 22:23:58,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:23:58,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:23:58,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:23:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:23:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-22 22:23:58,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:23:58,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-22 22:23:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:23:58,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-22 22:23:58,337 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-22 22:23:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:23:58,436 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-22 22:23:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:23:58,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-11-22 22:23:58,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:58,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2018-11-22 22:23:58,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-22 22:23:58,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 22:23:58,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2018-11-22 22:23:58,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:23:58,438 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-22 22:23:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2018-11-22 22:23:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-22 22:23:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-22 22:23:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-22 22:23:58,444 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-22 22:23:58,444 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-22 22:23:58,444 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-22 22:23:58,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-11-22 22:23:58,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:23:58,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:23:58,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:23:58,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:23:58,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:23:58,446 INFO L794 eck$LassoCheckResult]: Stem: 2065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2060#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2048#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2049#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2050#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2051#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2086#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2085#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2084#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2083#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2081#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2078#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2077#L21-3 assume !(main_~i~0 < 5); 2046#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2047#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2066#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2067#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2069#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2082#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2080#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2079#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2076#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2075#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2073#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2072#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2071#L25-3 assume !(main_~i~0 < 5); 2064#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2041#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2042#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2043#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2044#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2045#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2070#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2052#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2039#L30-4 main_~nc_B~0 := 0; 2040#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2061#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2062#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2063#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2074#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2068#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2053#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2054#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2059#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2055#L43-2 [2018-11-22 22:23:58,446 INFO L796 eck$LassoCheckResult]: Loop: 2055#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2056#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2055#L43-2 [2018-11-22 22:23:58,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-11-22 22:23:58,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:23:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-11-22 22:23:58,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:58,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:23:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-11-22 22:23:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:23:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:23:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:23:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:23:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:23:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:00,879 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 310 DAG size of output: 234 [2018-11-22 22:24:01,027 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-22 22:24:01,029 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:01,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:01,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:01,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:01,029 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:01,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:01,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:01,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:01,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-22 22:24:01,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:01,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:01,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:01,664 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-22 22:24:01,715 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:01,715 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:01,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:01,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:01,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:01,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,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-22 22:24:01,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,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-22 22:24:01,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,735 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-22 22:24:01,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,738 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-22 22:24:01,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:01,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:01,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:01,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:01,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:01,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:01,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:01,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:01,798 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-22 22:24:01,798 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-22 22:24:01,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:01,799 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:24:01,799 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:01,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:01,890 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-11-22 22:24:01,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:01,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:01,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:01,936 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-22 22:24:01,936 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-22 22:24:01,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-22 22:24:01,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 52 states and 60 transitions. Complement of second has 5 states. [2018-11-22 22:24:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:24:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-22 22:24:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-11-22 22:24:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-22 22:24:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-22 22:24:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:01,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-22 22:24:01,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:01,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-11-22 22:24:01,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-22 22:24:01,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 22:24:01,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-11-22 22:24:01,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:01,946 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-22 22:24:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-11-22 22:24:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-22 22:24:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-22 22:24:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-22 22:24:01,949 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-22 22:24:01,949 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-22 22:24:01,949 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-22 22:24:01,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-11-22 22:24:01,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:01,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:01,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:01,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:01,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:01,950 INFO L794 eck$LassoCheckResult]: Stem: 2424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2419#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2407#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2408#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2409#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2410#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2445#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2444#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2443#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2442#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2440#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2438#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2437#L21-3 assume !(main_~i~0 < 5); 2405#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2406#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2425#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2426#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2428#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2441#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2439#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2436#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2435#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2434#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2432#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2431#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2430#L25-3 assume !(main_~i~0 < 5); 2423#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2400#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2401#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2402#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2403#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2404#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2429#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2411#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2398#L30-4 main_~nc_B~0 := 0; 2399#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2420#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2421#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2422#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2433#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2427#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2412#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2413#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2447#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2446#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2418#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2414#L43-2 [2018-11-22 22:24:01,950 INFO L796 eck$LassoCheckResult]: Loop: 2414#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2415#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2414#L43-2 [2018-11-22 22:24:01,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-11-22 22:24:01,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:01,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:01,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:01,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-11-22 22:24:01,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:01,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:01,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:01,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-11-22 22:24:01,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:01,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-22 22:24:02,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:24:02,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:24:02,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:24:02,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:24:02,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:24:02,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-22 22:24:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:24:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-22 22:24:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:24:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:24:02,179 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-22 22:24:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:24:02,271 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-22 22:24:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:24:02,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2018-11-22 22:24:02,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:02,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 55 states and 63 transitions. [2018-11-22 22:24:02,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 22:24:02,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 22:24:02,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-22 22:24:02,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:02,272 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-22 22:24:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-22 22:24:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-22 22:24:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 22:24:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-22 22:24:02,275 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-22 22:24:02,275 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-22 22:24:02,275 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-22 22:24:02,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-11-22 22:24:02,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:02,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:02,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:02,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:02,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:02,276 INFO L794 eck$LassoCheckResult]: Stem: 2708#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2703#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2691#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2692#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2693#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2694#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2731#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2730#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2729#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2728#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2727#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2724#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2723#L21-3 assume !(main_~i~0 < 5); 2689#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2690#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2710#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2711#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2714#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2726#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2725#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2722#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2721#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2720#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2718#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2717#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2716#L25-3 assume !(main_~i~0 < 5); 2707#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2684#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2685#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2686#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2687#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2688#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2715#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2695#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2682#L30-4 main_~nc_B~0 := 0; 2683#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2704#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2713#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2732#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2705#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2706#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2719#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2712#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2696#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2697#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2702#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2709#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2733#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2698#L43-2 [2018-11-22 22:24:02,276 INFO L796 eck$LassoCheckResult]: Loop: 2698#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2699#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2698#L43-2 [2018-11-22 22:24:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-11-22 22:24:02,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-11-22 22:24:02,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-11-22 22:24:02,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-22 22:24:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:24:02,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6ecfa73-e9b4-4562-a9e7-32d4b4b6abb1/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-22 22:24:02,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:24:02,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:24:02,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:24:02,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-22 22:24:02,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:24:02,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-22 22:24:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:24:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:24:02,502 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-22 22:24:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:24:02,580 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-22 22:24:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:24:02,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 88 transitions. [2018-11-22 22:24:02,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:02,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 57 states and 65 transitions. [2018-11-22 22:24:02,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 22:24:02,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 22:24:02,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-22 22:24:02,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:02,582 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-22 22:24:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-22 22:24:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-22 22:24:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-22 22:24:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-22 22:24:02,588 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-22 22:24:02,588 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-22 22:24:02,588 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-22 22:24:02,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-11-22 22:24:02,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:24:02,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:02,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:02,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:02,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:02,590 INFO L794 eck$LassoCheckResult]: Stem: 3010#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3008#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2992#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2993#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2994#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2995#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3034#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3033#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3031#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3030#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3029#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3027#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3026#L21-3 assume !(main_~i~0 < 5); 2990#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2991#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3012#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3013#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3015#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3035#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3032#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3028#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3025#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3024#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3023#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3021#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3020#L25-3 assume !(main_~i~0 < 5); 3009#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2985#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2986#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2987#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2988#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2989#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2997#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3017#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3016#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2996#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2983#L30-4 main_~nc_B~0 := 0; 2984#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3005#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3006#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3007#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3022#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3019#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3018#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3014#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2998#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2999#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3004#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3011#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3036#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3000#L43-2 [2018-11-22 22:24:02,590 INFO L796 eck$LassoCheckResult]: Loop: 3000#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3001#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 3000#L43-2 [2018-11-22 22:24:02,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-11-22 22:24:02,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-11-22 22:24:02,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-11-22 22:24:02,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:02,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:05,724 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 358 DAG size of output: 269 [2018-11-22 22:24:05,992 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-22 22:24:05,994 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:05,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:05,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:05,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:05,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:05,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:05,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:05,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:05,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-22 22:24:05,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:05,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:05,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:05,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:05,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:06,610 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-22 22:24:07,282 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2018-11-22 22:24:07,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:07,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:07,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:07,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:07,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:07,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,372 INFO L205 nArgumentSynthesizer]: 36 stem disjuncts [2018-11-22 22:24:07,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,379 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2018-11-22 22:24:07,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,410 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:07,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:07,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:07,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:07,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:07,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:07,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:07,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:07,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:07,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:07,454 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:07,466 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:24:07,466 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:24:07,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:07,467 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:24:07,467 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:07,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:07,564 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-22 22:24:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,614 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-22 22:24:07,614 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-22 22:24:07,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-22 22:24:07,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-22 22:24:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:24:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-22 22:24:07,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-22 22:24:07,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:07,623 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:24:07,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,664 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-22 22:24:07,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:24:07,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-22 22:24:07,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-22 22:24:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:24:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-22 22:24:07,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-22 22:24:07,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:07,675 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:24:07,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:07,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:07,722 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-22 22:24:07,722 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:24:07,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-22 22:24:07,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 60 states and 71 transitions. Complement of second has 4 states. [2018-11-22 22:24:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:24:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-22 22:24:07,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-22 22:24:07,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:07,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-11-22 22:24:07,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:07,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-11-22 22:24:07,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:07,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-11-22 22:24:07,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:24:07,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-11-22 22:24:07,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-22 22:24:07,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 22:24:07,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-11-22 22:24:07,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:07,734 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-22 22:24:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-11-22 22:24:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-11-22 22:24:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-22 22:24:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-22 22:24:07,736 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-22 22:24:07,736 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-22 22:24:07,736 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-22 22:24:07,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-11-22 22:24:07,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:24:07,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:07,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:07,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:07,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:07,741 INFO L794 eck$LassoCheckResult]: Stem: 3867#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3862#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3852#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3853#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3854#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3855#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3892#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3891#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3890#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3889#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3888#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3887#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3886#L21-3 assume !(main_~i~0 < 5); 3850#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3851#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3868#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3869#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3871#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3885#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3883#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3882#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3879#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3878#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3877#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3875#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3874#L25-3 assume !(main_~i~0 < 5); 3866#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3845#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3846#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3847#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3848#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3849#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3876#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3873#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3872#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3856#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3843#L30-4 main_~nc_B~0 := 0; 3844#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3863#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3864#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3865#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3884#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3881#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3880#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3870#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3857#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3858#L43-2 [2018-11-22 22:24:07,741 INFO L796 eck$LassoCheckResult]: Loop: 3858#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3859#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3858#L43-2 [2018-11-22 22:24:07,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2018-11-22 22:24:07,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:07,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-11-22 22:24:07,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:07,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-11-22 22:24:07,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:24:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:11,578 WARN L180 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 309 DAG size of output: 231 [2018-11-22 22:24:11,720 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-22 22:24:11,722 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:11,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:11,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:11,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:11,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:11,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:11,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:11,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:11,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-11-22 22:24:11,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:11,722 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:11,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:11,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:12,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:12,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:12,344 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:12,344 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:12,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:12,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:12,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:12,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,372 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:12,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:12,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,377 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-22 22:24:12,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:24:12,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,380 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-22 22:24:12,380 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:24:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:12,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,392 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:12,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,394 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:12,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:12,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:12,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:12,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:12,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:12,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:12,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:12,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:12,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:12,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:12,428 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 22:24:12,428 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:24:12,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:12,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:24:12,429 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:12,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-22 22:24:12,636 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-11-22 22:24:12,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:12,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:12,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:12,684 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-22 22:24:12,684 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-22 22:24:12,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-22 22:24:12,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 69 transitions. Complement of second has 6 states. [2018-11-22 22:24:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-22 22:24:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:24:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-22 22:24:12,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-22 22:24:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-11-22 22:24:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-11-22 22:24:12,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:12,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-11-22 22:24:12,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:24:12,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-11-22 22:24:12,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-22 22:24:12,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 22:24:12,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-22 22:24:12,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:24:12,706 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-22 22:24:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-22 22:24:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-22 22:24:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-22 22:24:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-22 22:24:12,707 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-22 22:24:12,707 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-22 22:24:12,707 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-22 22:24:12,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-11-22 22:24:12,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:24:12,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:24:12,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:24:12,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:24:12,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:24:12,709 INFO L794 eck$LassoCheckResult]: Stem: 4335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4330#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4320#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4321#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4322#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4323#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4363#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4362#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4361#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4360#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4359#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4358#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4357#L21-3 assume !(main_~i~0 < 5); 4318#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4319#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4339#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4340#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4342#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4356#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4354#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4353#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4350#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4349#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4348#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4346#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4345#L25-3 assume !(main_~i~0 < 5); 4334#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4313#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4314#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4315#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4316#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4317#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4347#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4344#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4343#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4324#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4311#L30-4 main_~nc_B~0 := 0; 4312#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4331#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4332#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4333#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4355#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4352#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4351#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4341#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4325#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4326#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4328#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4338#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4336#L43 [2018-11-22 22:24:12,709 INFO L796 eck$LassoCheckResult]: Loop: 4336#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4337#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4336#L43 [2018-11-22 22:24:12,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2018-11-22 22:24:12,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:12,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:12,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:12,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-11-22 22:24:12,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:12,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:12,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:12,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:12,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:12,738 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-11-22 22:24:12,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:24:12,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:24:12,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:24:12,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:24:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:24:17,424 WARN L180 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 348 DAG size of output: 255 [2018-11-22 22:24:17,650 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-22 22:24:17,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:24:17,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:24:17,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:24:17,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:24:17,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:24:17,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:24:17,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:24:17,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:24:17,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration19_Lasso [2018-11-22 22:24:17,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:24:17,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:24:17,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-22 22:24:17,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-22 22:24:17,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,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-22 22:24:17,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-22 22:24:17,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-22 22:24:17,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-22 22:24:17,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:17,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,242 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2018-11-22 22:24:18,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:24:18,677 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-22 22:24:18,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:24:18,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:24:18,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,781 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:18,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:18,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,794 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:18,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,794 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:18,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,798 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:18,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,799 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:18,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:24:18,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:24:18,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:24:18,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:24:18,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:24:18,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:24:18,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,811 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-22 22:24:18,811 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:24:18,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,818 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-11-22 22:24:18,818 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-22 22:24:18,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:24:18,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-22 22:24:18,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:24:18,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:24:18,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:24:18,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:24:18,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:24:18,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:24:18,866 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:24:18,879 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 22:24:18,879 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-22 22:24:18,879 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:24:18,879 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:24:18,880 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:24:18,880 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_8, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_8 + 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:24:19,241 INFO L297 tatePredicateManager]: 51 out of 52 supporting invariants were superfluous and have been removed [2018-11-22 22:24:19,242 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:24:19,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:24:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:24:19,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:24:19,347 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-22 22:24:19,347 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 22:24:19,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-22 22:24:19,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 66 states and 77 transitions. Complement of second has 7 states. [2018-11-22 22:24:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 22:24:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:24:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-22 22:24:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-11-22 22:24:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-11-22 22:24:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-11-22 22:24:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:24:19,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-11-22 22:24:19,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:24:19,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-22 22:24:19,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:24:19,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:24:19,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:24:19,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:24:19,411 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:19,411 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:19,411 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:24:19,411 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-22 22:24:19,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:24:19,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:24:19,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:24:19,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:24:19 BoogieIcfgContainer [2018-11-22 22:24:19,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:24:19,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:24:19,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:24:19,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:24:19,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:23:46" (3/4) ... [2018-11-22 22:24:19,421 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:24:19,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:24:19,421 INFO L168 Benchmark]: Toolchain (without parser) took 33756.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -377.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,422 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,423 INFO L168 Benchmark]: Boogie Preprocessor took 59.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,423 INFO L168 Benchmark]: RCFGBuilder took 202.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,424 INFO L168 Benchmark]: BuchiAutomizer took 33282.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:24:19,424 INFO L168 Benchmark]: Witness Printer took 3.34 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:24:19,427 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.42 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 202.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 33282.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.34 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[string_A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function -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 + -1 * string_A and consists of 3 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + nc_A and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + j + -1 * i and consists of 5 locations. One nondeterministic module has affine ranking function nc_A + -1 * i and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.2s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 31.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 58 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 16. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 360 SDtfs, 415 SDslu, 467 SDs, 0 SdLazy, 744 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax100 hnf99 lsp96 ukn44 mio100 lsp57 div100 bol100 ite100 ukn100 eq170 hnf85 smp96 dnf311 smp88 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 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...