./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bee04d628cc50c5f036e0a10e9bd347013a62a54 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:49:56,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:49:56,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:49:56,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:49:56,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:49:56,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:49:56,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:49:56,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:49:56,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:49:56,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:49:56,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:49:56,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:49:56,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:49:56,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:49:56,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:49:56,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:49:56,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:49:56,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:49:56,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:49:56,898 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:49:56,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:49:56,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:49:56,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:49:56,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:49:56,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:49:56,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:49:56,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:49:56,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:49:56,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:49:56,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:49:56,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:49:56,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:49:56,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:49:56,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:49:56,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:49:56,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:49:56,907 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:49:56,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:49:56,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:49:56,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:49:56,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:49:56,921 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:49:56,921 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:49:56,921 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:49:56,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:49:56,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:49:56,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:49:56,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:49:56,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:49:56,924 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:49:56,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:49:56,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:49:56,924 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:49:56,925 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:49:56,925 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_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2018-11-23 03:49:56,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:49:56,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:49:56,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:49:56,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:49:56,958 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:49:56,958 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2018-11-23 03:49:56,999 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/data/e40a1bcee/cf58c04ad34144839b03641993ff7fd7/FLAG9d08c56ba [2018-11-23 03:49:57,436 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:49:57,437 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2018-11-23 03:49:57,443 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/data/e40a1bcee/cf58c04ad34144839b03641993ff7fd7/FLAG9d08c56ba [2018-11-23 03:49:57,454 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/bin-2019/uautomizer/data/e40a1bcee/cf58c04ad34144839b03641993ff7fd7 [2018-11-23 03:49:57,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:49:57,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:49:57,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:49:57,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:49:57,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:49:57,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c24d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57, skipping insertion in model container [2018-11-23 03:49:57,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:49:57,498 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:49:57,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:49:57,710 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:49:57,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:49:57,824 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:49:57,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57 WrapperNode [2018-11-23 03:49:57,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:49:57,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:49:57,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:49:57,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:49:57,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:49:57,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:49:57,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:49:57,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:49:57,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... [2018-11-23 03:49:57,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:49:57,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:49:57,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:49:57,880 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:49:57,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/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-11-23 03:49:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:49:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:49:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:49:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:49:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:49:57,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:49:58,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:49:58,091 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 03:49:58,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:58 BoogieIcfgContainer [2018-11-23 03:49:58,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:49:58,092 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:49:58,092 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:49:58,094 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:49:58,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:49:58,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:49:57" (1/3) ... [2018-11-23 03:49:58,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34ebb1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:49:58, skipping insertion in model container [2018-11-23 03:49:58,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:49:58,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:49:57" (2/3) ... [2018-11-23 03:49:58,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34ebb1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:49:58, skipping insertion in model container [2018-11-23 03:49:58,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:49:58,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:58" (3/3) ... [2018-11-23 03:49:58,097 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca_true-termination.c.i [2018-11-23 03:49:58,135 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:49:58,135 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:49:58,135 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:49:58,135 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:49:58,135 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:49:58,135 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:49:58,136 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:49:58,136 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:49:58,136 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:49:58,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:49:58,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:49:58,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:49:58,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:49:58,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:49:58,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:49:58,169 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:49:58,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 03:49:58,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:49:58,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:49:58,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:49:58,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:49:58,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:49:58,178 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 6#L369-4true [2018-11-23 03:49:58,178 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-23 03:49:58,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 03:49:58,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-23 03:49:58,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:58,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:49:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:49:58,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:49:58,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:49:58,312 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:49:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:49:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:49:58,323 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 03:49:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:49:58,327 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-23 03:49:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:49:58,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-23 03:49:58,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:49:58,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-23 03:49:58,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:49:58,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:49:58,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 03:49:58,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:49:58,334 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:49:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 03:49:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 03:49:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:49:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 03:49:58,351 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:49:58,351 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 03:49:58,351 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:49:58,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-23 03:49:58,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 03:49:58,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:49:58,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:49:58,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:49:58,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:49:58,352 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 47#L369-4 [2018-11-23 03:49:58,352 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2018-11-23 03:49:58,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 03:49:58,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:58,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:58,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:58,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-23 03:49:58,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:58,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:58,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:49:58,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:49:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-23 03:49:58,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:49:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:49:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:49:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:49:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:49:58,614 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 03:49:58,772 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-23 03:49:58,932 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 03:49:59,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:49:59,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:49:59,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:49:59,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:49:59,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:49:59,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:49:59,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:49:59,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:49:59,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 03:49:59,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:49:59,033 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:49:59,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,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-11-23 03:49:59,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:49:59,688 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-23 03:49:59,818 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:49:59,822 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:49:59,824 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-11-23 03:49:59,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:49:59,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,829 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-11-23 03:49:59,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:49:59,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:49:59,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,834 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-11-23 03:49:59,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:49:59,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,837 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-11-23 03:49:59,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:49:59,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:49:59,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,842 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-11-23 03:49:59,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:49:59,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,845 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-11-23 03:49:59,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:49:59,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,848 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-11-23 03:49:59,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:49:59,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:49:59,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,852 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-11-23 03:49:59,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,853 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 03:49:59,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:49:59,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,869 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-11-23 03:49:59,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:49:59,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:49:59,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:49:59,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,873 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-11-23 03:49:59,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:49:59,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:49:59,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:49:59,883 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-11-23 03:49:59,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:49:59,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:49:59,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:49:59,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:49:59,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:49:59,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:49:59,921 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:49:59,940 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:49:59,940 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:49:59,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:49:59,943 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:49:59,943 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:49:59,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-23 03:49:59,979 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-23 03:49:59,984 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:49:59,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:00,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:00,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:00,042 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-11-23 03:50:00,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 03:50:00,082 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-11-23 03:50:00,083 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-11-23 03:50:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:50:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-23 03:50:00,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 03:50:00,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:00,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-23 03:50:00,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:00,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-23 03:50:00,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:00,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-23 03:50:00,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:50:00,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-23 03:50:00,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:50:00,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:50:00,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-23 03:50:00,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:50:00,089 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:50:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-23 03:50:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:50:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:50:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 03:50:00,091 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:50:00,091 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-23 03:50:00,091 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:50:00,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-23 03:50:00,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:50:00,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:50:00,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:50:00,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:50:00,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:50:00,092 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 178#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 190#L372-5 [2018-11-23 03:50:00,092 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 185#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 186#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 190#L372-5 [2018-11-23 03:50:00,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-23 03:50:00,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:00,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:00,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 03:50:00,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-23 03:50:00,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:00,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:00,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:00,415 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-23 03:50:00,500 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:50:00,501 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:50:00,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:50:00,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:50:00,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:50:00,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:50:00,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:50:00,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:50:00,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 03:50:00,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:50:00,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:50:00,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,694 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-23 03:50:00,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:00,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:50:01,134 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 03:50:01,159 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:50:01,159 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:50:01,159 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-11-23 03:50:01,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:50:01,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:50:01,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:50:01,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,162 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-11-23 03:50:01,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:50:01,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,166 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-11-23 03:50:01,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:50:01,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:50:01,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:50:01,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,168 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-11-23 03:50:01,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:50:01,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,172 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-11-23 03:50:01,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:50:01,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:50:01,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:50:01,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:50:01,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:50:01,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:50:01,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,193 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-11-23 03:50:01,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,194 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:50:01,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:50:01,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:50:01,203 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-11-23 03:50:01,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:50:01,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:50:01,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:50:01,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:50:01,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:50:01,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:50:01,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:50:01,229 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:50:01,230 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:50:01,230 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:50:01,231 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:50:01,231 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:50:01,231 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-23 03:50:01,303 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 03:50:01,305 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:50:01,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:01,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:01,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:01,374 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-11-23 03:50:01,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 03:50:01,435 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-11-23 03:50:01,437 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-11-23 03:50:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:50:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 03:50:01,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:50:01,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:01,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 03:50:01,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:01,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 03:50:01,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:50:01,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 03:50:01,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:50:01,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-23 03:50:01,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:50:01,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:50:01,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-23 03:50:01,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:50:01,442 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-23 03:50:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-23 03:50:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:50:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:50:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 03:50:01,445 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:50:01,445 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 03:50:01,445 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:50:01,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 03:50:01,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:50:01,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:50:01,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:50:01,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:50:01,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:50:01,447 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 363#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 364#L382 assume !(main_~length1~0 < 1); 365#L382-2 assume !(main_~length2~0 < 1); 362#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 358#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 359#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 372#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 368#L372-1 assume !cstrcspn_#t~short210; 369#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 354#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 355#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 356#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 357#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 361#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 371#L372-5 [2018-11-23 03:50:01,447 INFO L796 eck$LassoCheckResult]: Loop: 371#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 366#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 367#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 371#L372-5 [2018-11-23 03:50:01,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-23 03:50:01,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:01,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 03:50:01,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:01,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:01,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:01,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2018-11-23 03:50:01,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:01,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:50:01,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:01,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:50:01,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4fabbba-470a-48e8-beea-1588b7e69545/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-11-23 03:50:01,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:01,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:01,668 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 33 treesize of output 23 [2018-11-23 03:50:01,672 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-11-23 03:50:01,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:50:01,698 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 22 treesize of output 34 [2018-11-23 03:50:01,704 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 20 treesize of output 21 [2018-11-23 03:50:01,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:50:01,725 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 19 treesize of output 18 [2018-11-23 03:50:01,726 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:50:01,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:50:01,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:50:01,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 03:50:01,749 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:33, output treesize:18 [2018-11-23 03:50:22,862 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 03:50:35,677 WARN L180 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 03:50:41,079 WARN L180 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-11-23 03:50:59,987 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 03:51:15,173 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 03:51:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:15,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:51:15,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 03:51:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 03:51:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2018-11-23 03:51:15,321 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2018-11-23 03:51:31,979 WARN L180 SmtUtils]: Spent 16.63 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 03:51:40,045 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2018-11-23 03:51:43,697 WARN L180 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2018-11-23 03:51:45,646 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 03:51:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:51:45,669 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 03:51:45,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:51:45,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2018-11-23 03:51:45,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:51:45,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2018-11-23 03:51:45,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 03:51:45,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 03:51:45,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-23 03:51:45,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:51:45,673 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 03:51:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-23 03:51:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-11-23 03:51:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:51:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 03:51:45,676 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:51:45,676 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 03:51:45,676 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:51:45,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 03:51:45,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:51:45,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:51:45,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:51:45,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:51:45,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:51:45,678 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 524#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 525#L382 assume !(main_~length1~0 < 1); 526#L382-2 assume !(main_~length2~0 < 1); 523#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(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, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, 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; 519#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 520#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 539#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 529#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 530#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 515#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 516#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 517#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 518#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 522#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 532#L372-5 [2018-11-23 03:51:45,678 INFO L796 eck$LassoCheckResult]: Loop: 532#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 527#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 528#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 532#L372-5 [2018-11-23 03:51:45,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-23 03:51:45,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:45,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:51:45,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:45,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:45,705 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 03:51:45,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:45,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:45,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:45,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-23 03:51:45,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:51:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:51:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:51:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:51:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:51:46,338 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 132 [2018-11-23 03:51:47,069 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 03:51:47,071 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:51:47,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:51:47,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:51:47,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:51:47,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:51:47,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:51:47,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:51:47,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:51:47,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 03:51:47,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:51:47,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:51:47,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,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-11-23 03:51:47,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,291 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:51:47,709 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-11-23 03:51:47,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:47,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:51:48,523 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-23 03:51:48,625 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-23 03:51:48,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:51:48,658 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:51:48,659 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-11-23 03:51:48,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,661 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-11-23 03:51:48,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,662 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-11-23 03:51:48,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,664 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-11-23 03:51:48,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,666 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-11-23 03:51:48,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,667 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-11-23 03:51:48,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,668 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-11-23 03:51:48,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,669 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-11-23 03:51:48,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,671 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-11-23 03:51:48,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,673 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-11-23 03:51:48,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,675 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-11-23 03:51:48,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,677 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-11-23 03:51:48,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,679 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-11-23 03:51:48,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:51:48,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:51:48,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:51:48,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,681 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-11-23 03:51:48,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,686 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-11-23 03:51:48,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,689 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-11-23 03:51:48,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:51:48,692 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-11-23 03:51:48,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:51:48,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:51:48,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:51:48,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:51:48,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:51:48,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:51:48,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:51:48,726 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:51:48,726 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:51:48,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:51:48,727 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:51:48,727 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:51:48,728 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2018-11-23 03:51:48,905 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2018-11-23 03:51:48,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:48,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:48,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:48,952 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-11-23 03:51:48,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 03:51:48,973 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-11-23 03:51:48,974 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-11-23 03:51:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:51:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 03:51:48,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:51:48,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:51:48,975 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:51:48,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:49,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:49,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:49,016 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-11-23 03:51:49,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 03:51:49,028 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-11-23 03:51:49,029 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-11-23 03:51:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:51:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 03:51:49,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:51:49,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:51:49,030 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:51:49,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:51:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:49,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:51:49,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:51:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:51:49,068 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-11-23 03:51:49,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 03:51:49,080 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-11-23 03:51:49,080 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-11-23 03:51:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:51:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 03:51:49,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-23 03:51:49,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:51:49,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-23 03:51:49,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:51:49,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-23 03:51:49,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:51:49,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 03:51:49,083 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:51:49,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2018-11-23 03:51:49,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:51:49,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:51:49,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:51:49,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:51:49,084 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:51:49,084 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:51:49,084 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:51:49,084 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:51:49,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:51:49,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:51:49,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:51:49,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:51:49 BoogieIcfgContainer [2018-11-23 03:51:49,090 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:51:49,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:51:49,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:51:49,090 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:51:49,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:49:58" (3/4) ... [2018-11-23 03:51:49,093 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:51:49,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:51:49,094 INFO L168 Benchmark]: Toolchain (without parser) took 111637.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.6 MB in the beginning and 864.7 MB in the end (delta: 91.9 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:49,095 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:51:49,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:49,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:49,096 INFO L168 Benchmark]: Boogie Preprocessor took 21.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:51:49,096 INFO L168 Benchmark]: RCFGBuilder took 211.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:49,096 INFO L168 Benchmark]: BuchiAutomizer took 110998.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Free memory was 1.1 GB in the beginning and 870.8 MB in the end (delta: 213.9 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:51:49,097 INFO L168 Benchmark]: Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 864.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:51:49,099 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 211.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 110998.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Free memory was 1.1 GB in the beginning and 870.8 MB in the end (delta: 213.9 MB). Peak memory consumption was 223.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 864.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + 2 * s and consists of 4 locations. One nondeterministic module has affine ranking function 2 * s + 1 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 110.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 80.0s. Construction of modules took 0.1s. Büchi inclusion checks took 30.6s. 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: 111 SDtfs, 146 SDslu, 87 SDs, 0 SdLazy, 135 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf99 lsp91 ukn71 mio100 lsp36 div119 bol100 ite100 ukn100 eq174 hnf83 smp92 dnf906 smp24 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 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...