./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat.i -s /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 169307d87ddc37871e07877236048b02359797e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:29:11,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:29:11,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:29:11,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:29:11,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:29:11,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:29:11,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:29:11,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:29:11,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:29:11,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:29:11,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:29:11,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:29:11,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:29:11,415 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:29:11,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:29:11,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:29:11,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:29:11,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:29:11,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:29:11,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:29:11,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:29:11,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:29:11,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:29:11,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:29:11,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:29:11,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:29:11,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:29:11,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:29:11,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:29:11,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:29:11,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:29:11,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:29:11,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:29:11,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:29:11,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:29:11,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:29:11,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:29:11,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:29:11,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:29:11,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:29:11,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:29:11,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:29:11,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:29:11,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:29:11,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:29:11,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:29:11,459 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:29:11,459 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:29:11,460 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:29:11,460 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:29:11,460 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:29:11,460 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:29:11,461 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:29:11,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:29:11,462 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:29:11,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:29:11,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:29:11,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:29:11,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:29:11,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:29:11,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:29:11,463 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:29:11,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:29:11,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:29:11,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:29:11,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:29:11,464 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:29:11,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:29:11,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:29:11,465 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:29:11,466 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:29:11,466 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 169307d87ddc37871e07877236048b02359797e9 [2019-11-15 22:29:11,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:29:11,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:29:11,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:29:11,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:29:11,529 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:29:11,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat.i [2019-11-15 22:29:11,584 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/data/0a195db4c/876673da10994e8ba74ce8f94a45269a/FLAG0bc12a394 [2019-11-15 22:29:11,977 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:29:11,980 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/sv-benchmarks/c/termination-libowfat/strcat.i [2019-11-15 22:29:12,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/data/0a195db4c/876673da10994e8ba74ce8f94a45269a/FLAG0bc12a394 [2019-11-15 22:29:12,326 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/data/0a195db4c/876673da10994e8ba74ce8f94a45269a [2019-11-15 22:29:12,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:29:12,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:29:12,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:29:12,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:29:12,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:29:12,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce673cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12, skipping insertion in model container [2019-11-15 22:29:12,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,348 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:29:12,378 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:29:12,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:29:12,737 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:29:12,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:29:12,850 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:29:12,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12 WrapperNode [2019-11-15 22:29:12,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:29:12,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:29:12,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:29:12,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:29:12,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:29:12,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:29:12,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:29:12,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:29:12,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... [2019-11-15 22:29:12,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:29:12,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:29:12,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:29:12,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:29:12,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87025b80-2099-4c1b-9f2f-f525d8991ef2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:29:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:29:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:29:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:29:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:29:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:29:13,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:29:13,449 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:29:13,449 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:29:13,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:29:13 BoogieIcfgContainer [2019-11-15 22:29:13,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:29:13,451 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:29:13,451 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:29:13,454 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:29:13,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:29:13,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:29:12" (1/3) ... [2019-11-15 22:29:13,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d06f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:29:13, skipping insertion in model container [2019-11-15 22:29:13,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:29:13,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:29:12" (2/3) ... [2019-11-15 22:29:13,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d06f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:29:13, skipping insertion in model container [2019-11-15 22:29:13,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:29:13,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:29:13" (3/3) ... [2019-11-15 22:29:13,459 INFO L371 chiAutomizerObserver]: Analyzing ICFG strcat.i [2019-11-15 22:29:13,502 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:29:13,503 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:29:13,503 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:29:13,503 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:29:13,503 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:29:13,504 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:29:13,504 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:29:13,504 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:29:13,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 22:29:13,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:29:13,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:29:13,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:29:13,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:29:13,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:29:13,545 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:29:13,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-15 22:29:13,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:29:13,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:29:13,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:29:13,548 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:29:13,548 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:29:13,554 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 4#L526true assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 15#L530true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 11#L532true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 18#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2019-11-15 22:29:13,554 INFO L793 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 19#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 23#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2019-11-15 22:29:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-11-15 22:29:13,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:13,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256916668] [2019-11-15 22:29:13,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,718 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2019-11-15 22:29:13,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:13,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188573568] [2019-11-15 22:29:13,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2019-11-15 22:29:13,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:13,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839645486] [2019-11-15 22:29:13,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:13,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:13,806 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:14,491 WARN L191 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-11-15 22:29:14,654 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-15 22:29:14,666 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:29:14,668 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:29:14,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:29:14,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:29:14,668 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:29:14,668 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:29:14,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:29:14,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:29:14,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat.i_Iteration1_Lasso [2019-11-15 22:29:14,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:29:14,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:29:14,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:14,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,162 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-15 22:29:15,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:15,563 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 22:29:16,228 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:29:16,416 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:29:16,421 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:29:16,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,427 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,438 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,442 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,451 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,452 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,476 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,476 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,503 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,506 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,510 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,523 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,523 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,533 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,533 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,547 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,548 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,548 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,550 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,551 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,551 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,578 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,591 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,597 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:29:16,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,635 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,635 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,651 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,657 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:29:16,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,665 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:29:16,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,726 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,727 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,737 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,737 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,740 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,741 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,741 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,744 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:29:16,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,744 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:29:16,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,745 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:29:16,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:29:16,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:29:16,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:29:16,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:29:16,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:29:16,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:29:16,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:29:16,753 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:29:16,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:29:16,838 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:29:16,869 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:29:16,870 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:29:16,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:29:16,873 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:29:16,873 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:29:16,874 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2019-11-15 22:29:16,900 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 22:29:16,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:29:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:16,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:29:16,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:16,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:29:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:29:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:16,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:29:16,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-15 22:29:17,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 5 states. [2019-11-15 22:29:17,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:29:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:29:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2019-11-15 22:29:17,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 22:29:17,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:29:17,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 22:29:17,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:29:17,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 22:29:17,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:29:17,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-11-15 22:29:17,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 22:29:17,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 24 states and 27 transitions. [2019-11-15 22:29:17,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:29:17,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 22:29:17,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-15 22:29:17,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:29:17,073 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 22:29:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-15 22:29:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-11-15 22:29:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:29:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 22:29:17,098 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 22:29:17,098 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 22:29:17,098 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:29:17,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-15 22:29:17,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:29:17,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:29:17,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:29:17,100 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:17,100 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:29:17,100 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 172#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 173#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 179#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 180#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 175#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 176#L516-2 [2019-11-15 22:29:17,101 INFO L793 eck$LassoCheckResult]: Loop: 176#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 177#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 185#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 183#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 182#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 176#L516-2 [2019-11-15 22:29:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2019-11-15 22:29:17,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144723305] [2019-11-15 22:29:17,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:29:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:29:17,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144723305] [2019-11-15 22:29:17,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:29:17,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:29:17,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501327171] [2019-11-15 22:29:17,195 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:29:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 1 times [2019-11-15 22:29:17,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687429699] [2019-11-15 22:29:17,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,252 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:17,736 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-11-15 22:29:17,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:29:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:29:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:29:17,814 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 22:29:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:29:17,858 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-15 22:29:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:29:17,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-15 22:29:17,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:29:17,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 22:29:17,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:29:17,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:29:17,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-15 22:29:17,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:29:17,861 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 22:29:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-15 22:29:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 22:29:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:29:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 22:29:17,863 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 22:29:17,863 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 22:29:17,863 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:29:17,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 22:29:17,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:29:17,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:29:17,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:29:17,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:29:17,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:29:17,865 INFO L791 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 217#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 218#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 224#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 225#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 213#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 215#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 219#L509-5 strlen_#res := strlen_~i~0; 220#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 221#L516-2 [2019-11-15 22:29:17,865 INFO L793 eck$LassoCheckResult]: Loop: 221#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 222#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 230#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 228#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 227#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 221#L516-2 [2019-11-15 22:29:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2019-11-15 22:29:17,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497921963] [2019-11-15 22:29:17,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,894 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 2 times [2019-11-15 22:29:17,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741857387] [2019-11-15 22:29:17,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:29:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash 648918087, now seen corresponding path program 1 times [2019-11-15 22:29:17,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:29:17,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001732191] [2019-11-15 22:29:17,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:29:17,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:29:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:29:17,986 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:29:18,526 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-11-15 22:29:19,110 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2019-11-15 22:29:19,258 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 22:29:19,261 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:29:19,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:29:19,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:29:19,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:29:19,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:29:19,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:29:19,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:29:19,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:29:19,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat.i_Iteration3_Lasso [2019-11-15 22:29:19,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:29:19,262 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:29:19,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:29:19,859 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-11-15 22:29:19,884 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:29:19,887 INFO L168 Benchmark]: Toolchain (without parser) took 7554.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:19,887 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:29:19,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:19,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:29:19,888 INFO L168 Benchmark]: Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:29:19,889 INFO L168 Benchmark]: RCFGBuilder took 476.18 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:19,890 INFO L168 Benchmark]: BuchiAutomizer took 6434.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.5 MB). Peak memory consumption was 356.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:29:19,893 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 476.18 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6434.65 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.5 MB). Peak memory consumption was 356.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...