./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/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 64bit --witnessprinter.graph.data.programhash 31b6f06b720558e9a2e510f7cce25403bea703ef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 13:08:45,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:08:45,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:08:45,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:08:45,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:08:45,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:08:45,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:08:45,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:08:45,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:08:45,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:08:45,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:08:45,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:08:45,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:08:45,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:08:45,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:08:45,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:08:45,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:08:45,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:08:45,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:08:45,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:08:45,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:08:45,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:08:45,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:08:45,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:08:45,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:08:45,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:08:45,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:08:45,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:08:45,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:08:45,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:08:45,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:08:45,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:08:45,645 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:08:45,645 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:08:45,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:08:45,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:08:45,646 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 13:08:45,654 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:08:45,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:08:45,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 13:08:45,655 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 13:08:45,655 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 13:08:45,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:08:45,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 13:08:45,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:08:45,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:08:45,657 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 13:08:45,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:08:45,657 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 13:08:45,657 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 13:08:45,657 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 13:08:45,658 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_8e82d9e7-b32e-4180-861b-f1c71508f771/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31b6f06b720558e9a2e510f7cce25403bea703ef [2018-12-02 13:08:45,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:08:45,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:08:45,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:08:45,684 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:08:45,684 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:08:45,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-02 13:08:45,718 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/data/33ce91274/9464abc6140b4b3cb1eeff04050b9dac/FLAG97ac50825 [2018-12-02 13:08:46,087 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:08:46,087 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-02 13:08:46,092 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/data/33ce91274/9464abc6140b4b3cb1eeff04050b9dac/FLAG97ac50825 [2018-12-02 13:08:46,469 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/bin-2019/uautomizer/data/33ce91274/9464abc6140b4b3cb1eeff04050b9dac [2018-12-02 13:08:46,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:08:46,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:08:46,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:08:46,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:08:46,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:08:46,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523e2e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46, skipping insertion in model container [2018-12-02 13:08:46,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:08:46,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:08:46,700 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:08:46,710 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:08:46,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:08:46,813 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:08:46,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46 WrapperNode [2018-12-02 13:08:46,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:08:46,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:08:46,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:08:46,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:08:46,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:08:46,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:08:46,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:08:46,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:08:46,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... [2018-12-02 13:08:46,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:08:46,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:08:46,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:08:46,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:08:46,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e82d9e7-b32e-4180-861b-f1c71508f771/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-12-02 13:08:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:08:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 13:08:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:08:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 13:08:46,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:08:46,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:08:47,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:08:47,035 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 13:08:47,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:47 BoogieIcfgContainer [2018-12-02 13:08:47,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:08:47,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 13:08:47,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 13:08:47,038 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 13:08:47,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:08:47,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:08:46" (1/3) ... [2018-12-02 13:08:47,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48797b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:08:47, skipping insertion in model container [2018-12-02 13:08:47,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:08:47,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:08:46" (2/3) ... [2018-12-02 13:08:47,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48797b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:08:47, skipping insertion in model container [2018-12-02 13:08:47,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 13:08:47,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:47" (3/3) ... [2018-12-02 13:08:47,041 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca_true-termination.c.i [2018-12-02 13:08:47,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 13:08:47,073 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 13:08:47,073 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 13:08:47,073 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 13:08:47,073 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:08:47,074 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:08:47,074 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 13:08:47,074 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:08:47,074 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 13:08:47,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 13:08:47,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 13:08:47,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:47,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:47,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:08:47,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 13:08:47,100 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 13:08:47,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 13:08:47,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 13:08:47,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:47,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:47,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:08:47,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 13:08:47,106 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2018-12-02 13:08:47,106 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-12-02 13:08:47,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 13:08:47,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:47,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 13:08:47,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:47,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:47,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:08:47,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:08:47,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 13:08:47,217 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 13:08:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 13:08:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 13:08:47,227 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 13:08:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:08:47,231 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 13:08:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 13:08:47,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 13:08:47,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 13:08:47,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 13:08:47,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 13:08:47,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 13:08:47,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 13:08:47,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:08:47,237 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 13:08:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 13:08:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 13:08:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 13:08:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 13:08:47,253 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 13:08:47,253 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 13:08:47,253 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 13:08:47,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 13:08:47,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 13:08:47,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:47,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:47,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 13:08:47,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:47,254 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2018-12-02 13:08:47,254 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-12-02 13:08:47,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 13:08:47,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:47,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:47,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:47,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 13:08:47,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:47,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:08:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 13:08:47,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:47,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:47,438 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-02 13:08:47,573 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-02 13:08:47,724 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-12-02 13:08:47,790 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:08:47,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:08:47,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:08:47,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:08:47,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:08:47,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:08:47,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:08:47,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:08:47,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 13:08:47,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:08:47,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:08:47,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:47,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:47,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:47,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,409 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:08:48,412 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:08:48,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:48,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:48,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:48,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:48,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:48,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:48,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:48,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:48,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:48,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:48,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:48,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:48,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,421 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:08:48,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,424 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:08:48,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:48,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,436 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:08:48,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:08:48,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:48,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:48,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:48,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:48,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:48,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:48,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:48,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:48,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:48,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:48,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:48,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:48,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:08:48,480 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 13:08:48,480 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 13:08:48,482 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:08:48,482 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:08:48,483 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:08:48,483 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2018-12-02 13:08:48,511 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 13:08:48,516 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:08:48,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:48,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:08:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:48,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:08:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:08:48,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 13:08:48,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 13:08:48,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-02 13:08:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:08:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 13:08:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 13:08:48,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 13:08:48,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:48,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 13:08:48,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:48,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 13:08:48,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:48,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 13:08:48,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 13:08:48,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 13:08:48,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 13:08:48,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 13:08:48,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 13:08:48,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:08:48,593 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 13:08:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 13:08:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 13:08:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 13:08:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 13:08:48,595 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 13:08:48,595 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 13:08:48,595 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 13:08:48,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 13:08:48,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 13:08:48,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:48,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:48,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:48,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:08:48,596 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 177#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 189#L372-5 [2018-12-02 13:08:48,596 INFO L796 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 184#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 185#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 189#L372-5 [2018-12-02 13:08:48,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 13:08:48,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:48,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 13:08:48,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:48,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:48,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 13:08:48,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:48,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:48,905 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-12-02 13:08:48,974 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:08:48,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:08:48,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:08:48,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:08:48,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:08:48,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:08:48,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:08:48,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:08:48,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 13:08:48,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:08:48,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:08:48,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:48,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,185 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-02 13:08:49,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:49,589 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-12-02 13:08:49,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:08:49,615 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:08:49,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:49,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:49,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:49,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:49,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:49,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:49,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:49,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:49,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:49,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:49,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:49,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:49,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:49,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:49,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:49,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:49,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:49,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:49,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:49,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:49,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:49,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:49,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:49,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:49,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:49,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:49,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:49,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:49,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:08:49,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:49,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:49,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:08:49,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:49,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:49,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:49,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:49,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:49,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:49,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:49,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:49,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:49,650 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:08:49,663 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 13:08:49,664 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 13:08:49,664 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:08:49,664 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 13:08:49,664 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:08:49,665 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 Supporting invariants [] [2018-12-02 13:08:49,694 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 13:08:49,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:08:49,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:49,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:08:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:49,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:08:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:08:49,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:08:49,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 13:08:49,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-02 13:08:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:08:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:08:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 13:08:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 13:08:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 13:08:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 13:08:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:08:49,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 13:08:49,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 13:08:49,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 13:08:49,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 13:08:49,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 13:08:49,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 13:08:49,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:08:49,773 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 13:08:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 13:08:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 13:08:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 13:08:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 13:08:49,774 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 13:08:49,774 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 13:08:49,774 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 13:08:49,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 13:08:49,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 13:08:49,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:49,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:49,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:49,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:08:49,775 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 371#L382 assume !(main_~length1~0 < 1); 372#L382-2 assume !(main_~length2~0 < 1); 369#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 365#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 366#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 379#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 375#L372-1 assume !cstrpbrk_#t~short210; 376#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 361#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 362#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 363#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 364#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 368#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 378#L372-5 [2018-12-02 13:08:49,775 INFO L796 eck$LassoCheckResult]: Loop: 378#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 373#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 374#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 378#L372-5 [2018-12-02 13:08:49,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 13:08:49,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:49,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:49,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:08:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:08:49,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:08:49,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 13:08:49,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 13:08:49,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 13:08:49,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:49,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:08:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 13:08:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:08:49,915 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 13:08:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:08:49,962 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-02 13:08:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:08:49,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-02 13:08:49,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 13:08:49,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-02 13:08:49,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 13:08:49,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 13:08:49,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-02 13:08:49,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 13:08:49,964 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 13:08:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-02 13:08:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-02 13:08:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 13:08:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-02 13:08:49,966 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 13:08:49,966 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 13:08:49,966 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 13:08:49,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-02 13:08:49,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 13:08:49,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 13:08:49,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 13:08:49,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:08:49,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 13:08:49,967 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 443#L382 assume !(main_~length1~0 < 1); 444#L382-2 assume !(main_~length2~0 < 1); 441#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 437#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 438#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 451#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 455#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 454#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 433#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 434#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 435#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 436#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 439#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 450#L372-5 [2018-12-02 13:08:49,967 INFO L796 eck$LassoCheckResult]: Loop: 450#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 446#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 447#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 450#L372-5 [2018-12-02 13:08:49,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 13:08:49,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:49,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:08:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,990 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 13:08:49,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:08:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:49,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:08:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 13:08:49,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 13:08:49,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 13:08:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:49,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 13:08:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:08:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:08:50,484 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-12-02 13:08:51,384 WARN L180 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-02 13:08:51,386 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 13:08:51,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 13:08:51,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 13:08:51,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 13:08:51,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 13:08:51,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 13:08:51,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 13:08:51,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 13:08:51,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 13:08:51,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 13:08:51,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 13:08:51,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 13:08:51,901 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-02 13:08:51,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 13:08:52,321 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 112 [2018-12-02 13:08:54,984 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 137 DAG size of output: 116 [2018-12-02 13:08:55,608 WARN L180 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-12-02 13:08:55,626 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 13:08:55,627 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 13:08:55,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:55,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:55,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:55,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:55,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:55,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:55,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:55,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:55,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:55,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:55,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:55,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:55,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 13:08:55,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 13:08:55,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 13:08:55,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:55,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:55,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,637 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 13:08:55,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,638 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 13:08:55,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:55,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:55,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:55,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:55,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:55,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 13:08:55,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 13:08:55,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 13:08:55,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 13:08:55,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 13:08:55,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 13:08:55,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 13:08:55,649 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-12-02 13:08:55,649 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-12-02 13:08:55,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 13:08:55,759 INFO L402 nArgumentSynthesizer]: We have 280 Motzkin's Theorem applications. [2018-12-02 13:08:55,759 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-12-02 13:08:59,027 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 13:09:02,165 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-02 13:09:02,165 INFO L444 ModelExtractionUtils]: 387 out of 406 variables were initially zero. Simplification set additionally 16 variables to zero. [2018-12-02 13:09:02,166 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 13:09:02,169 INFO L440 nArgumentSynthesizer]: Removed 14 redundant supporting invariants from a total of 14. [2018-12-02 13:09:02,170 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 13:09:02,170 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 Supporting invariants [] [2018-12-02 13:09:02,253 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2018-12-02 13:09:02,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 13:09:02,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:09:02,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:09:02,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 13:09:02,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 13:09:02,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:09:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:09:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 13:09:02,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 13:09:02,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:09:02,334 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 13:09:02,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:09:02,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:09:02,377 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 13:09:02,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 13:09:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:09:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:09:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 13:09:02,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 13:09:02,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:09:02,400 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 13:09:02,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:09:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:09:02,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:09:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:09:02,448 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 13:09:02,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 13:09:02,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-12-02 13:09:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 13:09:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 13:09:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 13:09:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 13:09:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:09:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 13:09:02,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:09:02,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 13:09:02,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 13:09:02,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-02 13:09:02,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:09:02,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-02 13:09:02,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 13:09:02,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 13:09:02,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 13:09:02,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 13:09:02,473 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:09:02,473 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:09:02,473 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:09:02,473 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 13:09:02,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 13:09:02,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 13:09:02,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 13:09:02,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:09:02 BoogieIcfgContainer [2018-12-02 13:09:02,477 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 13:09:02,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:09:02,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:09:02,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:09:02,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:08:47" (3/4) ... [2018-12-02 13:09:02,480 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 13:09:02,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:09:02,480 INFO L168 Benchmark]: Toolchain (without parser) took 16008.52 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 769.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 573.4 MB. Max. memory is 11.5 GB. [2018-12-02 13:09:02,481 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:09:02,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 13:09:02,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:09:02,482 INFO L168 Benchmark]: Boogie Preprocessor took 15.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:09:02,482 INFO L168 Benchmark]: RCFGBuilder took 177.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:09:02,483 INFO L168 Benchmark]: BuchiAutomizer took 15441.14 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 658.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.7 MB). Peak memory consumption was 581.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:09:02,483 INFO L168 Benchmark]: Witness Printer took 2.39 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:09:02,486 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.89 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 177.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15441.14 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 658.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.7 MB). Peak memory consumption was 581.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.39 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 149 SDslu, 72 SDs, 0 SdLazy, 101 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital367 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp61 div120 bol100 ite100 ukn100 eq174 hnf82 smp78 dnf1125 smp33 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 6520ms VariablesStem: 28 VariablesLoop: 18 DisjunctsStem: 12 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 280 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...