./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/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_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/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-1dbac8b [2018-10-27 06:11:27,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:27,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:27,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:27,909 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:27,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:27,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:27,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:27,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:27,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:27,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:27,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:27,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:27,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:27,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:27,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:27,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:27,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:27,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:27,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:27,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:27,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:27,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:27,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:27,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:27,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:27,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:27,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:27,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:27,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:27,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:27,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:27,950 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:27,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:27,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:27,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:27,953 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:27,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:27,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:27,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:27,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:27,971 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:27,971 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:27,972 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:27,972 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:27,972 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:27,972 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:27,972 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:27,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:27,973 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:27,973 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:27,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:27,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:27,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:27,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:27,974 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:27,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:27,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:27,975 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:27,975 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:27,976 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_e7a871f3-14db-43af-a5d8-eb4e34ee0091/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-10-27 06:11:28,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:28,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:28,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:28,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:28,037 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:28,037 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-10-27 06:11:28,083 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/data/7912c8106/30b0614ee72c4d6ebc60c40506acabb7/FLAG0b8270f63 [2018-10-27 06:11:28,486 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:28,486 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca_true-termination.c.i [2018-10-27 06:11:28,497 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/data/7912c8106/30b0614ee72c4d6ebc60c40506acabb7/FLAG0b8270f63 [2018-10-27 06:11:28,513 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/data/7912c8106/30b0614ee72c4d6ebc60c40506acabb7 [2018-10-27 06:11:28,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:28,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:28,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:28,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:28,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:28,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:28,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17edf047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28, skipping insertion in model container [2018-10-27 06:11:28,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:28,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:28,564 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:28,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:28,838 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:28,886 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:28,934 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:28,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28 WrapperNode [2018-10-27 06:11:28,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:28,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:28,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:28,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:28,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:28,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:29,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:29,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:29,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:29,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... [2018-10-27 06:11:29,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:29,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:29,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:29,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:29,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7a871f3-14db-43af-a5d8-eb4e34ee0091/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:29,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:29,562 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:29,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:29 BoogieIcfgContainer [2018-10-27 06:11:29,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:29,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:29,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:29,566 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:29,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:29,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:28" (1/3) ... [2018-10-27 06:11:29,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745ab1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:29, skipping insertion in model container [2018-10-27 06:11:29,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:29,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:28" (2/3) ... [2018-10-27 06:11:29,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745ab1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:29, skipping insertion in model container [2018-10-27 06:11:29,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:29,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:29" (3/3) ... [2018-10-27 06:11:29,570 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca_true-termination.c.i [2018-10-27 06:11:29,619 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:29,620 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:29,620 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:29,620 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:29,620 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:29,620 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:29,621 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:29,621 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:29,621 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:29,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:11:29,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:11:29,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,659 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:29,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:11:29,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:11:29,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,668 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 10#L382true assume !(main_~length1~0 < 1); 14#L382-2true assume !(main_~length2~0 < 1); 7#L385-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 13#L391true assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 4#L369-5true [2018-10-27 06:11:29,669 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 16#L369-1true SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 18#L369-2true assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 11#L371true SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 12#L371-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 3#L369-4true 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, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 4#L369-5true [2018-10-27 06:11:29,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,674 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:11:29,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:11:29,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:11:29,835 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:11:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:11:29,851 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:11:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:29,857 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:11:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:11:29,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:11:29,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:11:29,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:11:29,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:11:29,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:11:29,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:11:29,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:29,867 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:11:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:11:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:11:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:11:29,894 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:29,894 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:11:29,894 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:29,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:11:29,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:11:29,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,896 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 82#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 68#L369-5 [2018-10-27 06:11:29,896 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 78#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 81#L372-3 assume !cstrpbrk_#t~short210; 64#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 65#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 67#L369-4 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, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 68#L369-5 [2018-10-27 06:11:29,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:11:29,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:11:29,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:30,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:30,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:11:30,232 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:30,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:11:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:30,232 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:11:30,546 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 06:11:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:30,772 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:11:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:11:30,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:11:30,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:11:30,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-10-27 06:11:30,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:11:30,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:11:30,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-10-27 06:11:30,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:30,778 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-27 06:11:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-10-27 06:11:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-27 06:11:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:11:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 06:11:30,781 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:11:30,781 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:11:30,781 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:30,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-10-27 06:11:30,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:11:30,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:30,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:30,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:30,783 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 167#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 152#L369-5 [2018-10-27 06:11:30,788 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 162#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 166#L372-3 assume cstrpbrk_#t~short210; 168#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 172#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 158#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 151#L369-4 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, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 152#L369-5 [2018-10-27 06:11:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:11:30,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-10-27 06:11:30,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-10-27 06:11:30,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:31,433 WARN L179 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-10-27 06:11:31,606 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-10-27 06:11:31,873 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-10-27 06:11:31,981 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:11:31,994 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:31,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:31,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:31,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:31,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:31,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:31,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:31,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:31,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:11:31,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:31,998 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:32,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,385 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-27 06:11:32,560 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-10-27 06:11:32,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:32,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:33,151 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:33,156 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:33,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,189 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:33,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:33,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:33,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:33,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:33,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:33,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:33,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:33,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:33,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:33,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:33,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:33,244 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:33,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:33,349 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:33,353 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:11:33,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:33,357 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:33,358 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:33,360 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-10-27 06:11:33,442 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:33,448 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:33,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:33,554 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-10-27 06:11:33,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-10-27 06:11:33,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 40 states and 47 transitions. Complement of second has 7 states. [2018-10-27 06:11:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-10-27 06:11:33,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-10-27 06:11:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-10-27 06:11:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-10-27 06:11:33,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:33,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-10-27 06:11:33,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:33,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-10-27 06:11:33,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:11:33,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:11:33,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-10-27 06:11:33,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:33,615 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 06:11:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-10-27 06:11:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-27 06:11:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:11:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-27 06:11:33,618 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:11:33,618 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:11:33,618 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:33,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-10-27 06:11:33,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:33,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:33,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:33,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:33,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:33,619 INFO L793 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 365#L382 assume !(main_~length1~0 < 1); 366#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 362#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 379#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 376#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 355#L369-5 assume true; 357#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 382#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 367#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 368#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 350#L372-9 [2018-10-27 06:11:33,619 INFO L795 eck$LassoCheckResult]: Loop: 350#L372-9 assume true; 359#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 371#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 374#L372-3 assume !cstrpbrk_#t~short210; 349#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 350#L372-9 [2018-10-27 06:11:33,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:11:33,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:11:33,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:33,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:33,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:11:33,677 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:33,678 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:11:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:33,687 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-10-27 06:11:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:33,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-10-27 06:11:33,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:33,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-10-27 06:11:33,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:11:33,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:11:33,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-10-27 06:11:33,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:33,690 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-10-27 06:11:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:11:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:11:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:11:33,692 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:33,692 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:11:33,692 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:11:33,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:11:33,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:33,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:33,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:33,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:33,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:33,701 INFO L793 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 444#L382 assume !(main_~length1~0 < 1); 445#L382-2 assume !(main_~length2~0 < 1); 441#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 442#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 458#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 455#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 435#L369-5 assume true; 437#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 459#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 447#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 448#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 429#L372-9 [2018-10-27 06:11:33,701 INFO L795 eck$LassoCheckResult]: Loop: 429#L372-9 assume true; 439#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 451#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 453#L372-3 assume cstrpbrk_#t~short210; 456#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 461#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 428#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 429#L372-9 [2018-10-27 06:11:33,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:11:33,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:11:33,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:11:33,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:33,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:33,893 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-27 06:11:34,302 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2018-10-27 06:11:34,411 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-27 06:11:34,415 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:34,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:34,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:34,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:34,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:34,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:34,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:34,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:34,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:11:34,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:34,416 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:34,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,712 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-10-27 06:11:34,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,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-10-27 06:11:34,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,981 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-10-27 06:11:35,414 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-10-27 06:11:35,473 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:35,473 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:35,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:35,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,492 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:35,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,547 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:35,564 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:35,565 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:35,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:35,567 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:35,567 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:35,567 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-10-27 06:11:35,965 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:11:35,990 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:35,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:35,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:36,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:36,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:11:36,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:11:36,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-10-27 06:11:36,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:11:36,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:11:36,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:11:36,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:11:36,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-10-27 06:11:36,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:36,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-10-27 06:11:36,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:11:36,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:11:36,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-10-27 06:11:36,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:36,472 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-27 06:11:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-10-27 06:11:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-10-27 06:11:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:11:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:11:36,474 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:11:36,474 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:11:36,475 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:11:36,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:11:36,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:36,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:36,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:36,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:36,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:36,479 INFO L793 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 726#L382 assume !(main_~length1~0 < 1); 727#L382-2 assume !(main_~length2~0 < 1); 723#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 724#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 740#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 737#L391 assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~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; 714#L369-5 assume true; 715#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 745#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 730#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 731#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 720#L372-9 assume true; 722#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 733#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 736#L372-3 assume cstrpbrk_#t~short210; 739#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 742#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 710#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~short210; 711#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 718#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 712#L369-4 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, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 713#L369-5 assume true; 717#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 743#L369-2 assume !!(cstrpbrk_#t~mem206 != 49);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 728#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 729#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 709#L372-9 [2018-10-27 06:11:36,479 INFO L795 eck$LassoCheckResult]: Loop: 709#L372-9 assume true; 719#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 732#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 49; 735#L372-3 assume cstrpbrk_#t~short210; 738#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 741#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 708#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;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, cstrpbrk_#t~post211.offset + 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 709#L372-9 [2018-10-27 06:11:36,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-10-27 06:11:36,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:36,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:11:36,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:11:36,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:36,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:36,699 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-27 06:11:37,198 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 146 [2018-10-27 06:11:37,889 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2018-10-27 06:11:37,891 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:37,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:37,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:37,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:37,891 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:37,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:37,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:37,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:37,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:11:37,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:37,892 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:37,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,088 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:11:38,780 WARN L179 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2018-10-27 06:11:38,908 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-10-27 06:11:38,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:39,132 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-27 06:11:39,597 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-10-27 06:11:39,717 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-10-27 06:11:39,880 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:39,880 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:39,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:39,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:39,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:39,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:39,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:39,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:39,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:39,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:39,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:39,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:39,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:39,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:39,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:39,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:39,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:39,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:39,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:39,953 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-10-27 06:11:39,953 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-10-27 06:11:39,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,000 INFO L402 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2018-10-27 06:11:40,001 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-10-27 06:11:40,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:40,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:40,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,174 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:40,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,175 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:40,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:40,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:40,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:40,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:40,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:40,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:40,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:40,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:40,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:40,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:40,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:40,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:40,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:40,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:40,224 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:40,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:11:40,235 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:40,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:40,236 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:40,236 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:40,237 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-10-27 06:11:40,814 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-10-27 06:11:40,815 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:40,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:40,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:40,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:40,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:40,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:40,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:11:40,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:11:40,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:11:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:11:40,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:11:40,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:40,959 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:40,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:41,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:41,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:41,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:11:41,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:11:41,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:11:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:11:41,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:11:41,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:41,143 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:41,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:41,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:41,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:41,258 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:11:41,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:11:41,325 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-10-27 06:11:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:11:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-10-27 06:11:41,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:11:41,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:41,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:11:41,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:41,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:11:41,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:41,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:11:41,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:41,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:11:41,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:41,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:41,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:41,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:41,331 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:41,332 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:41,332 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:41,332 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:11:41,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:41,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:41,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:41,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:41 BoogieIcfgContainer [2018-10-27 06:11:41,341 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:41,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:41,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:41,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:41,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:29" (3/4) ... [2018-10-27 06:11:41,345 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:41,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:41,346 INFO L168 Benchmark]: Toolchain (without parser) took 12828.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 356.0 MB). Free memory was 957.1 MB in the beginning and 858.1 MB in the end (delta: 99.0 MB). Peak memory consumption was 455.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,346 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:41,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.48 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 930.2 MB in the beginning and 1.1 GB in the end (delta: -211.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,348 INFO L168 Benchmark]: Boogie Preprocessor took 33.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,348 INFO L168 Benchmark]: RCFGBuilder took 492.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,350 INFO L168 Benchmark]: BuchiAutomizer took 11778.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 257.2 MB). Peak memory consumption was 469.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:41,350 INFO L168 Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 1.4 GB. Free memory is still 858.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:41,353 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.48 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 930.2 MB in the beginning and 1.1 GB in the end (delta: -211.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 492.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11778.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 257.2 MB). Peak memory consumption was 469.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.57 ms. Allocated memory is still 1.4 GB. Free memory is still 858.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 188 SDtfs, 267 SDslu, 230 SDs, 0 SdLazy, 214 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital379 mio100 ax100 hnf99 lsp91 ukn85 mio100 lsp30 div122 bol100 ite100 ukn100 eq172 hnf82 smp91 dnf606 smp32 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 212ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 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...