./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:50,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:50,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:50,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:50,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:50,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:50,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:50,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:50,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:50,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:50,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:50,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:50,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:50,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:50,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:50,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:50,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:50,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:50,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:50,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:50,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:50,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:50,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:50,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:50,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:50,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:50,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:50,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:50,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:50,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:50,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:50,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:50,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:50,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:50,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:50,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:50,687 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:11:50,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:50,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:50,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:50,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:50,707 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:50,707 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:50,707 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:50,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:11:50,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:50,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:50,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:11:50,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:50,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:50,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:50,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:50,711 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:11:50,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:50,712 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:50,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:50,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:50,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:50,712 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:50,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:50,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:50,713 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:50,714 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:50,714 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2018-10-27 06:11:50,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:50,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:50,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:50,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:50,792 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:50,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:50,842 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/data/ff8017b5e/2f92782704b74227bdd2e31921057445/FLAG8b274b0b0 [2018-10-27 06:11:51,254 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:51,254 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:51,265 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/data/ff8017b5e/2f92782704b74227bdd2e31921057445/FLAG8b274b0b0 [2018-10-27 06:11:51,278 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/data/ff8017b5e/2f92782704b74227bdd2e31921057445 [2018-10-27 06:11:51,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:51,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:51,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:51,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:51,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:51,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ff3a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51, skipping insertion in model container [2018-10-27 06:11:51,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:51,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:51,572 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:51,581 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:51,619 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:51,655 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:51,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51 WrapperNode [2018-10-27 06:11:51,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:51,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:51,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:51,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:51,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:51,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:51,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:51,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:51,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... [2018-10-27 06:11:51,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:51,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:51,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:51,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:51,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:52,243 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:52,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:52 BoogieIcfgContainer [2018-10-27 06:11:52,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:52,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:52,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:52,248 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:52,249 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:52,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:51" (1/3) ... [2018-10-27 06:11:52,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56c6abf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:52, skipping insertion in model container [2018-10-27 06:11:52,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:52,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:51" (2/3) ... [2018-10-27 06:11:52,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56c6abf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:52, skipping insertion in model container [2018-10-27 06:11:52,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:52,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:52" (3/3) ... [2018-10-27 06:11:52,252 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:52,306 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:52,307 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:52,307 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:52,307 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:52,307 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:52,307 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:52,308 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:52,308 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:52,308 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:52,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:11:52,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:52,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:52,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:52,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,359 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:52,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-10-27 06:11:52,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:52,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:52,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:52,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,370 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L555true assume !(main_~length1~0 < 1); 14#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 17#L563true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 20#L563-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 13#L564true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 21#L546-6true [2018-10-27 06:11:52,374 INFO L795 eck$LassoCheckResult]: Loop: 21#L546-6true assume true; 8#L545-1true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 10#L545-2true SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 15#L545-3true cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 18#L545-4true assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 19#L546-5true assume !true; 21#L546-6true [2018-10-27 06:11:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:11:52,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1540280279, now seen corresponding path program 1 times [2018-10-27 06:11:52,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:52,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:52,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-27 06:11:52,569 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:11:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:11:52,586 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-10-27 06:11:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:52,592 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-10-27 06:11:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:11:52,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2018-10-27 06:11:52,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:52,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 21 transitions. [2018-10-27 06:11:52,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-10-27 06:11:52,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-10-27 06:11:52,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-10-27 06:11:52,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:52,603 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-10-27 06:11:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-27 06:11:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:11:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-10-27 06:11:52,629 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:52,629 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-10-27 06:11:52,629 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:52,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-10-27 06:11:52,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-10-27 06:11:52,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:52,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:52,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:52,632 INFO L793 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 60#L555 assume !(main_~length1~0 < 1); 61#L555-2 assume !(main_~length2~0 < 1); 56#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 57#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 70#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 68#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 66#L546-6 [2018-10-27 06:11:52,632 INFO L795 eck$LassoCheckResult]: Loop: 66#L546-6 assume true; 62#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 63#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 65#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 69#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 55#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 58#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 59#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 64#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 66#L546-6 [2018-10-27 06:11:52,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:11:52,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash -941209857, now seen corresponding path program 1 times [2018-10-27 06:11:52,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -843635947, now seen corresponding path program 1 times [2018-10-27 06:11:52,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:52,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:52,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:53,039 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:11:53,736 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-10-27 06:11:53,842 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:53,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:53,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:53,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:53,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:53,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:53,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:53,844 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:53,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-10-27 06:11:53,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:53,845 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:53,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:53,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,368 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-10-27 06:11:54,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:54,686 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:11:55,022 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:55,026 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:55,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:55,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:55,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:55,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:55,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:55,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:55,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:55,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:55,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:55,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:55,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:55,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:55,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:55,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:55,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:55,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:55,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:55,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:55,232 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:11:55,232 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:11:55,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:55,236 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:55,237 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:55,237 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2018-10-27 06:11:55,323 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:55,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:55,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:55,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:55,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:55,491 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:11:55,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-10-27 06:11:55,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 7 states. [2018-10-27 06:11:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-10-27 06:11:55,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 9 letters. [2018-10-27 06:11:55,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:55,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 17 letters. Loop has 9 letters. [2018-10-27 06:11:55,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:55,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 18 letters. [2018-10-27 06:11:55,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:55,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2018-10-27 06:11:55,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:55,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 29 transitions. [2018-10-27 06:11:55,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-10-27 06:11:55,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-10-27 06:11:55,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-10-27 06:11:55,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:55,585 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-10-27 06:11:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 06:11:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 06:11:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-27 06:11:55,587 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:55,587 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-27 06:11:55,587 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:55,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-10-27 06:11:55,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:55,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:55,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:55,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:55,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:55,589 INFO L793 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 230#L555 assume !(main_~length1~0 < 1); 231#L555-2 assume !(main_~length2~0 < 1); 224#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 225#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 244#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 239#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 240#L546-6 assume true; 232#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 233#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 236#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 242#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 221#L546-5 [2018-10-27 06:11:55,589 INFO L795 eck$LassoCheckResult]: Loop: 221#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 226#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 227#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 234#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 220#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 221#L546-5 [2018-10-27 06:11:55,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1016364753, now seen corresponding path program 1 times [2018-10-27 06:11:55,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:55,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:55,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:55,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 1 times [2018-10-27 06:11:55,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:55,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:55,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -382910472, now seen corresponding path program 1 times [2018-10-27 06:11:55,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:55,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:55,825 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:11:56,173 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-10-27 06:11:56,277 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:11:56,278 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:56,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:56,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:56,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:56,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:56,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:56,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:56,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:56,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-10-27 06:11:56,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:56,279 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:56,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,589 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2018-10-27 06:11:56,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:56,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:57,153 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:57,153 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:57,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:57,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:57,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:57,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:57,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:57,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:57,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:57,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:57,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:57,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:57,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:57,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:57,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:57,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:57,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:57,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,183 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:57,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:57,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:57,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:57,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,268 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:57,268 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-10-27 06:11:57,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,280 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-10-27 06:11:57,280 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-10-27 06:11:57,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:57,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:57,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:57,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:57,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:57,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:57,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:57,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:57,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:57,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:57,365 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:57,366 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:57,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:57,367 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:57,367 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-10-27 06:11:57,450 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:11:57,453 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:57,453 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:57,454 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:57,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:57,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:57,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:57,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:11:57,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-10-27 06:11:57,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 63 states and 71 transitions. Complement of second has 9 states. [2018-10-27 06:11:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-10-27 06:11:57,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 5 letters. [2018-10-27 06:11:57,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:57,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 18 letters. Loop has 5 letters. [2018-10-27 06:11:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:57,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 13 letters. Loop has 10 letters. [2018-10-27 06:11:57,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:57,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 71 transitions. [2018-10-27 06:11:57,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:57,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 48 transitions. [2018-10-27 06:11:57,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-10-27 06:11:57,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-10-27 06:11:57,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-10-27 06:11:57,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:57,699 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-27 06:11:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-10-27 06:11:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-10-27 06:11:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:11:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:11:57,704 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:57,704 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:57,704 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:57,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:11:57,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:11:57,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:57,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:57,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:57,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:57,706 INFO L793 eck$LassoCheckResult]: Stem: 485#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 469#L555 assume !(main_~length1~0 < 1); 470#L555-2 assume !(main_~length2~0 < 1); 463#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 464#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 484#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 479#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 480#L546-6 assume true; 489#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 493#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 492#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 486#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 462#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 467#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 468#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 476#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 477#L546-6 assume true; 474#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 475#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 478#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 483#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 460#L546-5 [2018-10-27 06:11:57,706 INFO L795 eck$LassoCheckResult]: Loop: 460#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 465#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 466#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 471#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 459#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 460#L546-5 [2018-10-27 06:11:57,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 190697767, now seen corresponding path program 2 times [2018-10-27 06:11:57,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:57,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:57,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 2 times [2018-10-27 06:11:57,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:57,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:57,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1881666402, now seen corresponding path program 1 times [2018-10-27 06:11:57,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:57,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:58,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:58,000 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_868264cb-1637-437a-a76c-78bd33d007d5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:58,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:58,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:58,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-27 06:11:58,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-27 06:11:58,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:58,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:58,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:11:58,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-10-27 06:12:04,797 WARN L179 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:12:07,794 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:12:20,998 WARN L179 SmtUtils]: Spent 12.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:12:21,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:12:21,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-10-27 06:12:21,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:21,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:21,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:21,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-10-27 06:12:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:21,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:21,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-10-27 06:12:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:12:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-10-27 06:12:21,082 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-10-27 06:12:23,391 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-10-27 06:12:24,513 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-27 06:12:25,938 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-27 06:12:49,995 WARN L179 SmtUtils]: Spent 24.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-10-27 06:12:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:50,144 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-10-27 06:12:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 06:12:50,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-10-27 06:12:50,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:50,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 59 states and 65 transitions. [2018-10-27 06:12:50,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:12:50,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:12:50,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2018-10-27 06:12:50,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:50,148 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-27 06:12:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2018-10-27 06:12:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-10-27 06:12:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-27 06:12:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-10-27 06:12:50,153 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-10-27 06:12:50,153 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-10-27 06:12:50,153 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:50,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 47 transitions. [2018-10-27 06:12:50,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:12:50,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:50,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:50,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:50,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:50,155 INFO L793 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 712#L555 assume !(main_~length1~0 < 1); 713#L555-2 assume !(main_~length2~0 < 1); 706#L558-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 707#L563 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L563 727#L563-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L563-1 723#L564 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 724#L546-6 assume true; 731#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 720#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 721#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 725#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 743#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 742#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 717#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 718#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 741#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 740#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 739#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 738#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 733#L546-3 assume !(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 732#L546-6 assume true; 714#L545-1 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset + 1; 715#L545-2 SUMMARY for call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1); srcloc: L545-2 734#L545-3 cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 728#L545-4 assume !!(cstrpbrk_~c~0 != 0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 703#L546-5 [2018-10-27 06:12:50,155 INFO L795 eck$LassoCheckResult]: Loop: 703#L546-5 assume true;cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset + 1; 708#L546-1 SUMMARY for call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1); srcloc: L546-1 709#L546-2 cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 716#L546-3 assume !!(cstrpbrk_~sc~0 != 0);havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset; 702#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 703#L546-5 [2018-10-27 06:12:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1623299104, now seen corresponding path program 2 times [2018-10-27 06:12:50,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:50,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 62061768, now seen corresponding path program 3 times [2018-10-27 06:12:50,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:50,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:50,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1313350729, now seen corresponding path program 3 times [2018-10-27 06:12:50,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:50,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:50,546 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:12:50,794 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 06:12:51,553 WARN L179 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 170 [2018-10-27 06:12:51,717 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-27 06:12:51,720 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:51,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:51,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:51,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:51,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:51,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:51,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:51,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:51,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:12:51,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:51,720 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:51,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:51,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:52,262 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2018-10-27 06:12:53,203 WARN L179 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-10-27 06:12:53,227 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:53,227 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:53,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:53,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:53,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:53,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:53,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:53,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:53,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:53,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:53,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:53,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:53,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:53,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:53,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:53,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:53,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:53,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:53,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:53,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:53,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:53,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:53,381 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:12:53,382 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:12:53,382 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:53,383 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:53,383 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:53,383 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-10-27 06:12:53,651 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-10-27 06:12:53,652 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:12:53,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:53,706 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:12:53,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:12:53,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 60 states and 67 transitions. Complement of second has 7 states. [2018-10-27 06:12:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-10-27 06:12:53,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:53,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:53,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:53,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:53,879 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:12:53,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:12:53,919 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 61 states and 68 transitions. Complement of second has 9 states. [2018-10-27 06:12:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-10-27 06:12:53,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:53,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:53,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:12:53,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:53,990 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-10-27 06:12:53,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:12:54,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 47 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 66 states and 74 transitions. Complement of second has 6 states. [2018-10-27 06:12:54,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-10-27 06:12:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 27 letters. Loop has 5 letters. [2018-10-27 06:12:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 32 letters. Loop has 5 letters. [2018-10-27 06:12:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 27 letters. Loop has 10 letters. [2018-10-27 06:12:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:54,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-10-27 06:12:54,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:54,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-10-27 06:12:54,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:12:54,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:12:54,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:12:54,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:54,083 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:54,083 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:54,084 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:54,084 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:54,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:54,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:12:54,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:12:54,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:54 BoogieIcfgContainer [2018-10-27 06:12:54,096 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:54,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:54,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:54,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:54,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:52" (3/4) ... [2018-10-27 06:12:54,103 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:12:54,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:54,103 INFO L168 Benchmark]: Toolchain (without parser) took 62822.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,104 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:54,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.17 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,105 INFO L168 Benchmark]: Boogie Preprocessor took 22.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,108 INFO L168 Benchmark]: RCFGBuilder took 467.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,109 INFO L168 Benchmark]: BuchiAutomizer took 61852.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.5 MB). Peak memory consumption was 154.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:54,109 INFO L168 Benchmark]: Witness Printer took 6.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:54,112 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.17 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 61852.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.5 MB). Peak memory consumption was 154.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * scanp and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 31.6s. Construction of modules took 0.4s. Büchi inclusion checks took 29.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 155 SDtfs, 182 SDslu, 307 SDs, 0 SdLazy, 325 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp96 ukn98 mio100 lsp40 div100 bol100 ite100 ukn100 eq188 hnf87 smp91 dnf236 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...