./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 022e5e55adeb2213dd3e7a54e30f105429bff667 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 03:07:05,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:07:05,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:07:05,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:07:05,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:07:05,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:07:05,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:07:05,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:07:05,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:07:05,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:07:05,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:07:05,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:07:05,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:07:05,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:07:05,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:07:05,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:07:05,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:07:05,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:07:05,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:07:05,743 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:07:05,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:07:05,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:07:05,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:07:05,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:07:05,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:07:05,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:07:05,746 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:07:05,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:07:05,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:07:05,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:07:05,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:07:05,748 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:07:05,748 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:07:05,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:07:05,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:07:05,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:07:05,750 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 03:07:05,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:07:05,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:07:05,758 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 03:07:05,759 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 03:07:05,759 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 03:07:05,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 03:07:05,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 03:07:05,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:07:05,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:07:05,762 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 03:07:05,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:07:05,762 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 03:07:05,762 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 03:07:05,763 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 03:07:05,763 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_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-12-09 03:07:05,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:07:05,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:07:05,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:07:05,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:07:05,789 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:07:05,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 03:07:05,824 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/data/87b3503dc/815b0211f8164880b2e035caa16d5341/FLAG918dabedb [2018-12-09 03:07:06,180 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:07:06,180 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 03:07:06,187 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/data/87b3503dc/815b0211f8164880b2e035caa16d5341/FLAG918dabedb [2018-12-09 03:07:06,557 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/data/87b3503dc/815b0211f8164880b2e035caa16d5341 [2018-12-09 03:07:06,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:07:06,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:07:06,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:06,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:07:06,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:07:06,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06, skipping insertion in model container [2018-12-09 03:07:06,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:07:06,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:07:06,736 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:06,742 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:07:06,806 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:07:06,825 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:07:06,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06 WrapperNode [2018-12-09 03:07:06,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:07:06,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:06,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:07:06,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:07:06,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:07:06,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:07:06,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:07:06,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:07:06,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... [2018-12-09 03:07:06,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:07:06,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:07:06,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:07:06,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:07:06,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 03:07:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:07:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 03:07:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:07:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 03:07:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:07:06,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:07:07,037 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:07:07,038 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 03:07:07,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:07 BoogieIcfgContainer [2018-12-09 03:07:07,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:07:07,038 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 03:07:07,038 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 03:07:07,041 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 03:07:07,041 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 03:07:07,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 03:07:06" (1/3) ... [2018-12-09 03:07:07,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e43915a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:07:07, skipping insertion in model container [2018-12-09 03:07:07,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 03:07:07,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:07:06" (2/3) ... [2018-12-09 03:07:07,042 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e43915a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:07:07, skipping insertion in model container [2018-12-09 03:07:07,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 03:07:07,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:07" (3/3) ... [2018-12-09 03:07:07,044 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 03:07:07,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 03:07:07,077 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 03:07:07,077 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 03:07:07,077 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 03:07:07,077 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:07:07,077 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:07:07,077 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 03:07:07,077 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:07:07,077 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 03:07:07,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 03:07:07,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 03:07:07,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:07:07,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:07:07,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 03:07:07,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 03:07:07,102 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 03:07:07,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 03:07:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 03:07:07,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:07:07,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:07:07,103 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 03:07:07,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 03:07:07,108 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 15#L545-4true [2018-12-09 03:07:07,109 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 18#L550true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 13#L545-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 15#L545-4true [2018-12-09 03:07:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-09 03:07:07,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-09 03:07:07,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:07,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:07:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 03:07:07,219 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 03:07:07,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 03:07:07,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 03:07:07,229 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-09 03:07:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:07,233 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-09 03:07:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 03:07:07,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-09 03:07:07,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 03:07:07,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-09 03:07:07,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 03:07:07,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 03:07:07,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-09 03:07:07,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 03:07:07,239 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 03:07:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-09 03:07:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-09 03:07:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 03:07:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-09 03:07:07,255 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 03:07:07,255 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-09 03:07:07,255 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 03:07:07,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-09 03:07:07,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 03:07:07,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:07:07,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:07:07,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 03:07:07,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:07,256 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 55#L545-4 [2018-12-09 03:07:07,256 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 50#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 46#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 49#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 55#L545-4 [2018-12-09 03:07:07,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-09 03:07:07,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-09 03:07:07,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:07,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:07:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-09 03:07:07,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:07,439 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-12-09 03:07:07,594 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-09 03:07:07,722 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-09 03:07:07,793 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 03:07:07,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 03:07:07,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 03:07:07,794 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 03:07:07,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 03:07:07,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 03:07:07,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 03:07:07,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 03:07:07,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-09 03:07:07,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 03:07:07,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 03:07:07,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:07,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-12-09 03:07:07,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:07,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-12-09 03:07:07,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-12-09 03:07:08,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:08,375 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-12-09 03:07:08,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 03:07:08,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 03:07:08,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:08,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:08,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:08,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:08,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:08,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:08,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:08,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:08,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:08,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:08,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,501 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-09 03:07:08,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,502 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:07:08,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:08,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,512 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:07:08,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,513 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:07:08,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:08,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:08,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:08,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,538 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:07:08,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,539 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:07:08,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:08,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:08,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:08,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:08,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:08,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:08,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:08,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:08,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 03:07:08,568 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 03:07:08,569 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 03:07:08,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 03:07:08,571 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 03:07:08,571 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 03:07:08,571 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-12-09 03:07:08,596 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 03:07:08,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 03:07:08,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:08,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:07:08,660 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 03:07:08,661 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-09 03:07:08,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-09 03:07:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 03:07:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 03:07:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-09 03:07:08,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-09 03:07:08,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:08,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-09 03:07:08,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:08,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-09 03:07:08,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:08,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-09 03:07:08,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:07:08,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-09 03:07:08,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 03:07:08,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 03:07:08,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-09 03:07:08,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 03:07:08,721 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-09 03:07:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-09 03:07:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 03:07:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 03:07:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-09 03:07:08,723 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-09 03:07:08,723 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-09 03:07:08,723 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 03:07:08,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-09 03:07:08,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:07:08,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:07:08,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:07:08,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:08,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 03:07:08,724 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 195#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 185#L548-5 [2018-12-09 03:07:08,724 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 180#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 181#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 185#L548-5 [2018-12-09 03:07:08,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:08,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-09 03:07:08,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:08,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:08,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-09 03:07:08,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:08,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-09 03:07:08,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:08,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:09,059 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-09 03:07:09,136 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 03:07:09,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 03:07:09,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 03:07:09,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 03:07:09,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 03:07:09,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 03:07:09,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 03:07:09,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 03:07:09,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-09 03:07:09,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 03:07:09,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 03:07:09,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:07:09,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 03:07:09,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 03:07:09,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:07:09,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:07:09,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:07:09,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,742 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:07:09,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:07:09,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,752 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:07:09,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,754 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:07:09,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,766 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:07:09,766 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-09 03:07:09,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,784 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-12-09 03:07:09,785 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-09 03:07:09,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:07:09,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:07:09,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:07:09,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:07:09,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:07:09,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:07:09,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:07:09,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:07:09,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 03:07:09,873 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 03:07:09,873 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 03:07:09,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 03:07:09,874 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 03:07:09,874 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 03:07:09,874 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-12-09 03:07:09,912 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 03:07:09,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 03:07:09,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:09,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:09,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:07:09,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 03:07:09,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-09 03:07:10,007 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-09 03:07:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 03:07:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 03:07:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 03:07:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-09 03:07:10,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:10,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-09 03:07:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:10,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-09 03:07:10,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:07:10,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-09 03:07:10,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:07:10,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-09 03:07:10,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 03:07:10,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 03:07:10,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-09 03:07:10,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 03:07:10,011 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-09 03:07:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-09 03:07:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-09 03:07:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 03:07:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-09 03:07:10,013 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-09 03:07:10,013 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-09 03:07:10,013 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 03:07:10,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-09 03:07:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:07:10,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:07:10,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:07:10,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:10,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 03:07:10,015 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 376#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 379#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L548-1 assume !cstrcspn_#t~short7; 366#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 367#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 372#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 373#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 374#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 365#L548-5 [2018-12-09 03:07:10,015 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 360#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 361#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 365#L548-5 [2018-12-09 03:07:10,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-09 03:07:10,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:10,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-09 03:07:10,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:10,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:07:10,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-12-09 03:07:10,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:07:10,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:07:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:07:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:07:10,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:10,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_34c270ac-c315-4364-aedb-8b17331c38a2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 03:07:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:10,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:10,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-09 03:07:10,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 03:07:10,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:10,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-12-09 03:07:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-09 03:07:10,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:10,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-09 03:07:10,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:10,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:10,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:10,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:10,224 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-12-09 03:07:47,690 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 03:08:12,876 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 03:08:27,330 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 03:08:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:27,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 03:08:27,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-09 03:08:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 03:08:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-12-09 03:08:27,438 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-12-09 03:08:30,431 WARN L180 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-12-09 03:08:32,603 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-09 03:08:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:32,646 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-09 03:08:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:08:32,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-12-09 03:08:32,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:08:32,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-12-09 03:08:32,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 03:08:32,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 03:08:32,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-12-09 03:08:32,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 03:08:32,649 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-09 03:08:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-12-09 03:08:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-09 03:08:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 03:08:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-09 03:08:32,651 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-09 03:08:32,651 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-09 03:08:32,651 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 03:08:32,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-09 03:08:32,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 03:08:32,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 03:08:32,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 03:08:32,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:08:32,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 03:08:32,652 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 534#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 519#L558 assume !(main_~length1~0 < 1); 520#L558-2 assume !(main_~length2~0 < 1); 525#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 540#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 541#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 543#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 523#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L548-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 535#L548-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 536#L550 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 537#L545-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 538#L545-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 529#L545-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 526#L548-5 [2018-12-09 03:08:32,652 INFO L796 eck$LassoCheckResult]: Loop: 526#L548-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 521#L548-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 522#L548-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 526#L548-5 [2018-12-09 03:08:32,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:32,652 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-09 03:08:32,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:08:32,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:08:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:08:32,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:32,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-09 03:08:32,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:08:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:08:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:32,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-09 03:08:32,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 03:08:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 03:08:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:33,118 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-12-09 03:08:33,647 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-09 03:08:33,649 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 03:08:33,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 03:08:33,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 03:08:33,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 03:08:33,649 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 03:08:33,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 03:08:33,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 03:08:33,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 03:08:33,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-09 03:08:33,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 03:08:33,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 03:08:33,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:33,802 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 03:08:34,145 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-12-09 03:08:34,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 03:08:34,678 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 120 [2018-12-09 03:08:34,731 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 03:08:39,181 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 176 DAG size of output: 125 [2018-12-09 03:08:39,953 WARN L180 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2018-12-09 03:08:39,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 03:08:39,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 03:08:39,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 03:08:39,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 03:08:39,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 03:08:39,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,984 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 03:08:39,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 03:08:39,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 03:08:39,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 03:08:39,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:39,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 03:08:39,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 03:08:39,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 03:08:39,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 03:08:39,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 03:08:39,993 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2018-12-09 03:08:39,993 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-09 03:08:39,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 03:08:40,120 INFO L402 nArgumentSynthesizer]: We have 276 Motzkin's Theorem applications. [2018-12-09 03:08:40,121 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-09 03:08:42,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 03:08:44,375 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2018-12-09 03:08:44,376 INFO L444 ModelExtractionUtils]: 359 out of 378 variables were initially zero. Simplification set additionally 16 variables to zero. [2018-12-09 03:08:44,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 03:08:44,378 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2018-12-09 03:08:44,379 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 03:08:44,379 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 Supporting invariants [] [2018-12-09 03:08:44,499 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-12-09 03:08:44,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 03:08:44,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:44,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 03:08:44,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 03:08:44,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-12-09 03:08:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 03:08:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 03:08:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-09 03:08:44,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-09 03:08:44,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:08:44,540 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 03:08:44,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:44,566 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 03:08:44,566 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 03:08:44,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2018-12-09 03:08:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 03:08:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 03:08:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-09 03:08:44,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-09 03:08:44,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:08:44,576 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 03:08:44,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:08:44,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 03:08:44,605 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 03:08:44,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 03:08:44,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2018-12-09 03:08:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 03:08:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 03:08:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-12-09 03:08:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-09 03:08:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:08:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-09 03:08:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:08:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-09 03:08:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 03:08:44,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-12-09 03:08:44,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 03:08:44,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-12-09 03:08:44,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 03:08:44,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 03:08:44,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 03:08:44,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 03:08:44,620 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 03:08:44,620 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 03:08:44,620 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 03:08:44,620 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 03:08:44,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 03:08:44,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 03:08:44,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 03:08:44,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 03:08:44 BoogieIcfgContainer [2018-12-09 03:08:44,624 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 03:08:44,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:08:44,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:08:44,624 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:08:44,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:07:07" (3/4) ... [2018-12-09 03:08:44,627 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 03:08:44,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:08:44,627 INFO L168 Benchmark]: Toolchain (without parser) took 98067.71 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 570.4 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -375.3 MB). Peak memory consumption was 195.2 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,628 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:44,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,629 INFO L168 Benchmark]: Boogie Preprocessor took 15.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:44,629 INFO L168 Benchmark]: RCFGBuilder took 169.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,629 INFO L168 Benchmark]: BuchiAutomizer took 97585.54 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -259.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:44,629 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:44,631 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 97585.54 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -259.5 MB). Peak memory consumption was 208.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 97.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 91.9s. Construction of modules took 0.0s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 115 SDslu, 95 SDs, 0 SdLazy, 151 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp69 div125 bol100 ite100 ukn100 eq169 hnf83 smp79 dnf1846 smp25 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 4385ms VariablesStem: 30 VariablesLoop: 19 DisjunctsStem: 16 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 276 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...