./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/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 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:16:28,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:16:28,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:16:28,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:16:28,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:16:28,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:16:28,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:16:28,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:16:28,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:16:28,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:16:28,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:16:28,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:16:28,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:16:28,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:16:28,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:16:28,420 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:16:28,421 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:16:28,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:16:28,423 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:16:28,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:16:28,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:16:28,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:16:28,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:16:28,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:16:28,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:16:28,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:16:28,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:16:28,431 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:16:28,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:16:28,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:16:28,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:16:28,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:16:28,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:16:28,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:16:28,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:16:28,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:16:28,434 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:16:28,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:16:28,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:16:28,444 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:16:28,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:16:28,444 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:16:28,444 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:16:28,444 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:16:28,444 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:16:28,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:16:28,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:16:28,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:16:28,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:16:28,447 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:16:28,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:16:28,448 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:16:28,448 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:16:28,449 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:16:28,449 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_4efe75a3-d83d-4dab-afc8-90a1001cde17/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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-11-18 10:16:28,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:16:28,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:16:28,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:16:28,483 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:16:28,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:16:28,484 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-18 10:16:28,518 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/data/6fa66eb1d/7318175e3efa44168abfe890f924a031/FLAGcdc04e605 [2018-11-18 10:16:28,907 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:16:28,907 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-18 10:16:28,911 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/data/6fa66eb1d/7318175e3efa44168abfe890f924a031/FLAGcdc04e605 [2018-11-18 10:16:28,921 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/data/6fa66eb1d/7318175e3efa44168abfe890f924a031 [2018-11-18 10:16:28,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:16:28,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:16:28,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:16:28,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:16:28,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:16:28,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:28" (1/1) ... [2018-11-18 10:16:28,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e32060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:28, skipping insertion in model container [2018-11-18 10:16:28,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:28" (1/1) ... [2018-11-18 10:16:28,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:16:28,949 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:16:29,051 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:16:29,053 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:16:29,065 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:16:29,077 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:16:29,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29 WrapperNode [2018-11-18 10:16:29,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:16:29,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:16:29,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:16:29,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:16:29,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:16:29,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:16:29,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:16:29,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:16:29,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... [2018-11-18 10:16:29,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:16:29,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:16:29,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:16:29,155 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:16:29,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:16:29,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:16:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:16:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:16:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:16:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:16:29,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:16:29,335 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:16:29,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:29 BoogieIcfgContainer [2018-11-18 10:16:29,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:16:29,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:16:29,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:16:29,339 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:16:29,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:16:29,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:16:28" (1/3) ... [2018-11-18 10:16:29,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a9c74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:16:29, skipping insertion in model container [2018-11-18 10:16:29,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:16:29,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:29" (2/3) ... [2018-11-18 10:16:29,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a9c74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:16:29, skipping insertion in model container [2018-11-18 10:16:29,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:16:29,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:29" (3/3) ... [2018-11-18 10:16:29,343 INFO L375 chiAutomizerObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-18 10:16:29,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:16:29,387 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:16:29,387 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:16:29,387 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:16:29,388 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:16:29,388 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:16:29,388 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:16:29,388 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:16:29,388 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:16:29,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 10:16:29,420 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:16:29,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:29,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:29,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:16:29,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:16:29,427 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:16:29,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 10:16:29,428 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-18 10:16:29,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:29,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:29,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:16:29,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:16:29,435 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 21#L18-4true [2018-11-18 10:16:29,436 INFO L796 eck$LassoCheckResult]: Loop: 21#L18-4true assume true; 7#L18-1true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3#L18-3true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 21#L18-4true [2018-11-18 10:16:29,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:16:29,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:29,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 10:16:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:29,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 10:16:29,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:29,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:29,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:29,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:29,789 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:16:29,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:16:29,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:16:29,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:16:29,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:16:29,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:16:29,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:16:29,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:16:29,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 10:16:29,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:16:29,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:16:29,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,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-18 10:16:29,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-18 10:16:29,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:29,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:30,257 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-11-18 10:16:30,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:16:30,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:16:30,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:30,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:30,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:30,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:30,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:30,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:30,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,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-18 10:16:30,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:30,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,347 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:30,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,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-18 10:16:30,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:30,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:30,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:30,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:30,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,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-18 10:16:30,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,354 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:30,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:30,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:30,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-18 10:16:30,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:30,359 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:30,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:30,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:30,362 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:30,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:30,387 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:16:30,405 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:16:30,405 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:16:30,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:16:30,409 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:16:30,409 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:16:30,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#str1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#str1~0.offset Supporting invariants [] [2018-11-18 10:16:30,417 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 10:16:30,421 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:16:30,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:30,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:30,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:30,480 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:16:30,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2018-11-18 10:16:30,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 39 states and 51 transitions. Complement of second has 8 states. [2018-11-18 10:16:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:16:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:16:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-18 10:16:30,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 10:16:30,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:30,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 10:16:30,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:30,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 10:16:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:30,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2018-11-18 10:16:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 10:16:30,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 18 states and 23 transitions. [2018-11-18 10:16:30,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 10:16:30,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 10:16:30,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-18 10:16:30,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:16:30,525 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 10:16:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-18 10:16:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 10:16:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 10:16:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-18 10:16:30,542 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 10:16:30,542 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 10:16:30,542 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:16:30,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-11-18 10:16:30,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 10:16:30,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:30,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:30,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:16:30,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:16:30,543 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 127#L18-4 assume true; 120#L18-1 assume !(main_~i~0 < main_~MAX~0); 121#L18-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 128#L25-4 [2018-11-18 10:16:30,543 INFO L796 eck$LassoCheckResult]: Loop: 128#L25-4 assume true; 129#L25-1 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 131#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 128#L25-4 [2018-11-18 10:16:30,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 10:16:30,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:30,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:16:30,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:16:30,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:16:30,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2018-11-18 10:16:30,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:30,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:16:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:16:30,637 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 10:16:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:16:30,664 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 10:16:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:16:30,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-11-18 10:16:30,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 10:16:30,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 21 transitions. [2018-11-18 10:16:30,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 10:16:30,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 10:16:30,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-18 10:16:30,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:16:30,667 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 10:16:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-18 10:16:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 10:16:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 10:16:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 10:16:30,669 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 10:16:30,669 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 10:16:30,669 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:16:30,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 10:16:30,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-18 10:16:30,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:30,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:30,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:16:30,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:16:30,670 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 173#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 174#L18-4 assume true; 169#L18-1 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 163#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 164#L18-4 assume true; 167#L18-1 assume !(main_~i~0 < main_~MAX~0); 168#L18-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 175#L25-4 [2018-11-18 10:16:30,671 INFO L796 eck$LassoCheckResult]: Loop: 175#L25-4 assume true; 176#L25-1 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 178#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 175#L25-4 [2018-11-18 10:16:30,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 10:16:30,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:30,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2018-11-18 10:16:30,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1694431954, now seen corresponding path program 1 times [2018-11-18 10:16:30,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:30,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:30,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:16:30,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:30,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:16:30,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:16:30,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:16:30,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:16:30,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:16:30,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:16:30,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:16:30,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:16:30,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-18 10:16:30,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:16:30,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:16:30,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:30,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-18 10:16:30,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-18 10:16:30,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,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-18 10:16:31,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:31,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-18 10:16:31,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:16:31,233 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:16:31,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:31,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:31,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:31,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:31,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:31,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:31,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:31,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:31,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:31,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:31,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,243 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:31,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:31,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:31,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:31,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:31,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:31,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,255 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:31,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,256 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:31,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:31,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:31,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:31,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:31,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:31,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:31,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:31,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:31,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:31,278 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:16:31,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:16:31,283 INFO L444 ModelExtractionUtils]: 22 out of 25 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:16:31,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:16:31,284 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:16:31,284 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:16:31,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-18 10:16:31,305 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 10:16:31,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:31,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:31,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:31,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:16:31,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 10:16:31,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-11-18 10:16:31,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:16:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:16:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 10:16:31,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 10:16:31,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:31,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 10:16:31,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:31,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 10:16:31,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:31,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-18 10:16:31,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:16:31,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-18 10:16:31,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 10:16:31,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 10:16:31,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-18 10:16:31,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:16:31,390 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 10:16:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-18 10:16:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 10:16:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 10:16:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 10:16:31,395 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 10:16:31,395 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 10:16:31,395 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:16:31,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 10:16:31,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:16:31,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:31,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:31,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:16:31,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:16:31,396 INFO L794 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 281#L18-4 assume true; 276#L18-1 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 270#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 271#L18-4 assume true; 274#L18-1 assume !(main_~i~0 < main_~MAX~0); 275#L18-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 282#L25-4 assume true; 284#L25-1 assume !(main_~i~0 >= 0); 279#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 272#L31-4 [2018-11-18 10:16:31,396 INFO L796 eck$LassoCheckResult]: Loop: 272#L31-4 assume true; 273#L31-1 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 278#L4 assume !(0 == __VERIFIER_assert_~cond); 288#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 277#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 272#L31-4 [2018-11-18 10:16:31,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1694432012, now seen corresponding path program 1 times [2018-11-18 10:16:31,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:31,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:31,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:16:31,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4efe75a3-d83d-4dab-afc8-90a1001cde17/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:16:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:31,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:16:31,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2018-11-18 10:16:31,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:16:31,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 1 times [2018-11-18 10:16:31,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:31,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:16:31,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:16:31,603 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-18 10:16:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:16:31,628 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 10:16:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:16:31,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 30 transitions. [2018-11-18 10:16:31,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:16:31,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 29 transitions. [2018-11-18 10:16:31,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 10:16:31,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 10:16:31,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-11-18 10:16:31,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:16:31,630 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 10:16:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-11-18 10:16:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-11-18 10:16:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 10:16:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-18 10:16:31,632 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 10:16:31,632 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 10:16:31,632 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:16:31,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2018-11-18 10:16:31,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:16:31,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:16:31,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:16:31,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:16:31,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:16:31,633 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.alloc(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.alloc(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 369#L18-4 assume true; 364#L18-1 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 358#L18-3 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 359#L18-4 assume true; 362#L18-1 assume !(main_~i~0 < main_~MAX~0); 363#L18-5 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 370#L25-4 assume true; 371#L25-1 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 375#L25-3 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 372#L25-4 assume true; 373#L25-1 assume !(main_~i~0 >= 0); 367#L25-5 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 360#L31-4 [2018-11-18 10:16:31,633 INFO L796 eck$LassoCheckResult]: Loop: 360#L31-4 assume true; 361#L31-1 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 366#L4 assume !(0 == __VERIFIER_assert_~cond); 376#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7;havoc main_#t~mem8;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 365#L31-3 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 360#L31-4 [2018-11-18 10:16:31,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -71690769, now seen corresponding path program 1 times [2018-11-18 10:16:31,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:31,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:31,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:31,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,650 INFO L82 PathProgramCache]: Analyzing trace with hash 63145100, now seen corresponding path program 2 times [2018-11-18 10:16:31,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:31,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:31,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:16:31,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1204817058, now seen corresponding path program 1 times [2018-11-18 10:16:31,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:16:31,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:16:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:16:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:16:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:16:31,928 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-18 10:16:32,049 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2018-11-18 10:16:32,050 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:16:32,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:16:32,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:16:32,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:16:32,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:16:32,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:16:32,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:16:32,051 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:16:32,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: invert_string_false-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-18 10:16:32,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:16:32,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:16:32,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-18 10:16:32,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:16:32,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:16:32,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:16:32,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:32,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:32,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:32,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:32,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:32,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:32,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:32,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:16:32,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:16:32,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:16:32,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:32,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:32,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:32,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,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-18 10:16:32,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:16:32,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,410 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:16:32,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:16:32,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:16:32,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:16:32,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:16:32,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:16:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:16:32,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:16:32,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:16:32,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:16:32,456 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:16:32,457 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:16:32,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:16:32,458 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:16:32,458 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:16:32,458 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~#str2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_3 + 2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~#str2~0.offset Supporting invariants [] [2018-11-18 10:16:32,502 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-18 10:16:32,503 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:16:32,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:16:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:32,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:16:32,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:16:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:16:32,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:16:32,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 10:16:32,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 21 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 25 states and 28 transitions. Complement of second has 6 states. [2018-11-18 10:16:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:16:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:16:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-18 10:16:32,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 5 letters. [2018-11-18 10:16:32,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:32,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 5 letters. [2018-11-18 10:16:32,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:32,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 10:16:32,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:16:32,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-18 10:16:32,575 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:16:32,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-18 10:16:32,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:16:32,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:16:32,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:16:32,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:16:32,575 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:16:32,575 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:16:32,575 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:16:32,575 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:16:32,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:16:32,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:16:32,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:16:32,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:16:32 BoogieIcfgContainer [2018-11-18 10:16:32,581 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:16:32,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:16:32,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:16:32,582 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:16:32,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:29" (3/4) ... [2018-11-18 10:16:32,585 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:16:32,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:16:32,586 INFO L168 Benchmark]: Toolchain (without parser) took 3661.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 960.2 MB in the beginning and 891.6 MB in the end (delta: 68.6 MB). Peak memory consumption was 289.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,587 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:16:32,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,588 INFO L168 Benchmark]: Boogie Preprocessor took 52.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,588 INFO L168 Benchmark]: RCFGBuilder took 180.67 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,589 INFO L168 Benchmark]: BuchiAutomizer took 3245.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 891.6 MB in the end (delta: 232.6 MB). Peak memory consumption was 306.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:16:32,589 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory is still 891.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:16:32,595 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.76 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.67 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3245.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 891.6 MB in the end (delta: 232.6 MB). Peak memory consumption was 306.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory is still 891.6 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str1] + -1 * i + -1 * str1 and consists of 5 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[str1] + 2 * j + 2 * str2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 55 SDslu, 37 SDs, 0 SdLazy, 65 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf99 lsp86 ukn65 mio100 lsp73 div143 bol100 ite100 ukn100 eq157 hnf71 smp87 dnf153 smp84 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...