./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/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 aca5f83919a6623f93755f2c57c9c6598ba71e3b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:17:36,808 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:17:36,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:17:36,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:17:36,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:17:36,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:17:36,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:17:36,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:17:36,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:17:36,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:17:36,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:17:36,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:17:36,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:17:36,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:17:36,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:17:36,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:17:36,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:17:36,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:17:36,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:17:36,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:17:36,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:17:36,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:17:36,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:17:36,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:17:36,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:17:36,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:17:36,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:17:36,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:17:36,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:17:36,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:17:36,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:17:36,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:17:36,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:17:36,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:17:36,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:17:36,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:17:36,836 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:17:36,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:17:36,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:17:36,848 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:17:36,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:17:36,848 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:17:36,848 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:17:36,848 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:17:36,848 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:17:36,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:17:36,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:17:36,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:17:36,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:17:36,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:17:36,851 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:17:36,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:17:36,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:17:36,851 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:17:36,852 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:17:36,852 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_9a6c7b9f-f1b6-4162-ad1d-027714582388/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 -> aca5f83919a6623f93755f2c57c9c6598ba71e3b [2018-11-18 09:17:36,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:17:36,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:17:36,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:17:36,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:17:36,888 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:17:36,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-18 09:17:36,931 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/data/84a0bf169/6b3ae1302cf14838801a3f05a97229ed/FLAGfd98f52c0 [2018-11-18 09:17:37,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:17:37,370 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/sv-benchmarks/c/termination-libowfat/strspn_true-termination.c.i [2018-11-18 09:17:37,376 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/data/84a0bf169/6b3ae1302cf14838801a3f05a97229ed/FLAGfd98f52c0 [2018-11-18 09:17:37,385 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/bin-2019/uautomizer/data/84a0bf169/6b3ae1302cf14838801a3f05a97229ed [2018-11-18 09:17:37,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:17:37,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:17:37,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:17:37,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:17:37,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:17:37,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c27ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37, skipping insertion in model container [2018-11-18 09:17:37,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:17:37,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:17:37,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:17:37,623 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:17:37,651 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:17:37,726 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:17:37,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37 WrapperNode [2018-11-18 09:17:37,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:17:37,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:17:37,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:17:37,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:17:37,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:17:37,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:17:37,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:17:37,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:17:37,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... [2018-11-18 09:17:37,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:17:37,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:17:37,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:17:37,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:17:37,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a6c7b9f-f1b6-4162-ad1d-027714582388/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-18 09:17:37,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:17:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:17:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:17:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:17:37,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:17:37,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:17:37,983 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:17:37,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:17:37 BoogieIcfgContainer [2018-11-18 09:17:37,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:17:37,984 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:17:37,984 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:17:37,986 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:17:37,987 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:17:37,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:17:37" (1/3) ... [2018-11-18 09:17:37,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f00bed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:17:37, skipping insertion in model container [2018-11-18 09:17:37,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:17:37,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:17:37" (2/3) ... [2018-11-18 09:17:37,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f00bed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:17:37, skipping insertion in model container [2018-11-18 09:17:37,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:17:37,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:17:37" (3/3) ... [2018-11-18 09:17:37,990 INFO L375 chiAutomizerObserver]: Analyzing ICFG strspn_true-termination.c.i [2018-11-18 09:17:38,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:17:38,030 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:17:38,030 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:17:38,031 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:17:38,031 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:17:38,031 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:17:38,031 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:17:38,031 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:17:38,031 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:17:38,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 09:17:38,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 09:17:38,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:38,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:38,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:17:38,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:17:38,061 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:17:38,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-18 09:17:38,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 09:17:38,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:38,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:38,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:17:38,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:17:38,070 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L521true assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 6#L525true assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 19#L510-4true [2018-11-18 09:17:38,070 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-4true assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 12#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4#L511-6true assume !true; 5#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 7#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 15#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 19#L510-4true [2018-11-18 09:17:38,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-18 09:17:38,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:38,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1366197546, now seen corresponding path program 1 times [2018-11-18 09:17:38,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:38,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:38,183 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-18 09:17:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:17:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:17:38,187 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:17:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:17:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:17:38,198 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-18 09:17:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:17:38,202 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-18 09:17:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:17:38,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-18 09:17:38,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 09:17:38,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 15 transitions. [2018-11-18 09:17:38,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 09:17:38,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 09:17:38,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-18 09:17:38,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:17:38,209 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-18 09:17:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-18 09:17:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 09:17:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 09:17:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-18 09:17:38,227 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-18 09:17:38,227 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-18 09:17:38,227 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:17:38,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-18 09:17:38,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 09:17:38,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:38,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:38,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 09:17:38,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:17:38,229 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 52#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 48#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 49#L510-4 [2018-11-18 09:17:38,229 INFO L796 eck$LassoCheckResult]: Loop: 49#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 55#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 44#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 45#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 53#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 46#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 47#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 50#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 49#L510-4 [2018-11-18 09:17:38,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-18 09:17:38,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:38,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1786909933, now seen corresponding path program 1 times [2018-11-18 09:17:38,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:38,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:17:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1162005510, now seen corresponding path program 1 times [2018-11-18 09:17:38,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:38,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:38,477 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-18 09:17:38,714 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-11-18 09:17:38,785 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:17:38,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:17:38,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:17:38,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:17:38,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:17:38,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:17:38,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:17:38,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:17:38,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration2_Lasso [2018-11-18 09:17:38,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:17:38,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:17:38,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:38,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,024 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-11-18 09:17:39,078 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-18 09:17:39,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:39,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-18 09:17:39,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:17:39,374 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:17:39,375 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-18 09:17:39,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,380 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-18 09:17:39,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,383 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-18 09:17:39,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,386 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-18 09:17:39,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,388 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-18 09:17:39,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,392 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-18 09:17:39,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:39,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,397 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-18 09:17:39,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,397 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:17:39,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,398 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:17:39,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,404 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-18 09:17:39,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:39,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,422 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-18 09:17:39,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:39,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,426 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-18 09:17:39,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:39,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:39,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,429 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-18 09:17:39,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:39,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,434 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-18 09:17:39,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,434 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:17:39,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,437 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:17:39,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:39,448 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-18 09:17:39,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:39,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:39,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:39,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:39,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:39,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:39,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:17:39,487 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:17:39,487 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:17:39,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:17:39,490 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:17:39,491 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:17:39,491 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-18 09:17:39,518 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 09:17:39,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:17:39,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:39,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:39,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:39,615 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-18 09:17:39,618 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-18 09:17:39,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-18 09:17:39,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 5 states. [2018-11-18 09:17:39,689 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-18 09:17:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:17:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 09:17:39,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 09:17:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:39,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-18 09:17:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:39,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-18 09:17:39,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:39,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-18 09:17:39,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:17:39,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 24 transitions. [2018-11-18 09:17:39,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:17:39,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 09:17:39,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-18 09:17:39,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:17:39,694 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:17:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-18 09:17:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 09:17:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:17:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-18 09:17:39,696 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:17:39,696 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:17:39,696 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:17:39,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-18 09:17:39,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:17:39,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:39,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:39,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:17:39,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:17:39,698 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 189#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 185#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 186#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 193#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 179#L511-6 [2018-11-18 09:17:39,698 INFO L796 eck$LassoCheckResult]: Loop: 179#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 180#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 190#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 195#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 179#L511-6 [2018-11-18 09:17:39,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2018-11-18 09:17:39,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:39,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:39,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 1 times [2018-11-18 09:17:39,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:39,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:39,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:39,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 736220242, now seen corresponding path program 1 times [2018-11-18 09:17:39,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:39,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:40,036 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-18 09:17:40,119 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:17:40,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:17:40,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:17:40,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:17:40,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:17:40,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:17:40,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:17:40,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:17:40,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration3_Lasso [2018-11-18 09:17:40,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:17:40,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:17:40,123 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-18 09:17:40,126 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-18 09:17:40,281 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-18 09:17:40,332 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-18 09:17:40,334 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-18 09:17:40,335 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-18 09:17:40,335 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-18 09:17:40,337 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-18 09:17:40,338 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-18 09:17:40,339 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-18 09:17:40,340 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-18 09:17:40,341 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-18 09:17:40,342 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-18 09:17:40,342 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-18 09:17:40,343 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-18 09:17:40,344 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-18 09:17:40,346 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-18 09:17:40,347 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-18 09:17:40,348 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-18 09:17:40,348 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-18 09:17:40,349 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-18 09:17:40,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:17:40,629 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:17:40,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:17:40,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:40,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:40,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:40,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:40,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:17:40,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:17:40,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,634 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:17:40,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:40,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,643 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-18 09:17:40,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:40,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:40,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:40,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:17:40,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,647 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:17:40,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,648 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:17:40,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:40,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,654 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-18 09:17:40,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:40,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:40,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:40,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,658 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-18 09:17:40,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,658 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:17:40,658 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 09:17:40,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,665 INFO L402 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2018-11-18 09:17:40,665 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 09:17:40,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:40,695 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-18 09:17:40,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:40,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:40,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:40,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:40,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:40,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:40,716 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:17:40,734 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 09:17:40,734 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:17:40,735 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:17:40,735 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:17:40,736 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:17:40,736 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_2 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-18 09:17:40,793 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 09:17:40,794 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:17:40,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:40,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:40,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:40,836 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-18 09:17:40,836 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-18 09:17:40,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 09:17:40,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 48 states and 60 transitions. Complement of second has 5 states. [2018-11-18 09:17:40,861 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-18 09:17:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 09:17:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-18 09:17:40,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 09:17:40,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:40,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 09:17:40,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:40,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 09:17:40,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:40,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2018-11-18 09:17:40,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:17:40,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 32 states and 40 transitions. [2018-11-18 09:17:40,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 09:17:40,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 09:17:40,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-18 09:17:40,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:17:40,864 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-18 09:17:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-18 09:17:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-18 09:17:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:17:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-18 09:17:40,866 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 09:17:40,866 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-18 09:17:40,866 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:17:40,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-18 09:17:40,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:17:40,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:40,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:40,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:17:40,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:17:40,869 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 371#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 367#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 368#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 377#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 378#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 373#L511-1 assume !strspn_#t~short7; 374#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 365#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 366#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 369#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 380#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 376#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 361#L511-6 [2018-11-18 09:17:40,870 INFO L796 eck$LassoCheckResult]: Loop: 361#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 362#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 372#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 379#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 361#L511-6 [2018-11-18 09:17:40,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1779209729, now seen corresponding path program 1 times [2018-11-18 09:17:40,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:40,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:40,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:40,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:17:40,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:17:40,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:17:40,905 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:17:40,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 2 times [2018-11-18 09:17:40,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:40,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:40,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:17:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:17:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:17:41,004 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 09:17:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:17:41,030 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-18 09:17:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:17:41,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-18 09:17:41,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 09:17:41,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 38 transitions. [2018-11-18 09:17:41,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 09:17:41,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 09:17:41,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-11-18 09:17:41,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:17:41,032 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-18 09:17:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-11-18 09:17:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-18 09:17:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 09:17:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-18 09:17:41,034 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-18 09:17:41,034 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-18 09:17:41,034 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:17:41,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-18 09:17:41,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 09:17:41,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:17:41,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:17:41,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:17:41,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 09:17:41,036 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 442#L521 assume !(main_~in_len~0 < 1);call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet13;havoc main_#t~nondet13; 438#L525 assume !(main_~out_len~0 < 1);call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);assume { :begin_inline_strspn } true;strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 439#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 448#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 449#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 457#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 454#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 436#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 437#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 440#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 452#L510-4 assume true;call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 447#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 432#L511-6 [2018-11-18 09:17:41,036 INFO L796 eck$LassoCheckResult]: Loop: 432#L511-6 assume true;call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 433#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 443#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem5; 450#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 432#L511-6 [2018-11-18 09:17:41,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 4202367, now seen corresponding path program 2 times [2018-11-18 09:17:41,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:17:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1696358, now seen corresponding path program 3 times [2018-11-18 09:17:41,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:17:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:41,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1675488540, now seen corresponding path program 1 times [2018-11-18 09:17:41,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:17:41,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:17:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:17:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:17:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:17:41,485 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 130 [2018-11-18 09:17:41,569 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:17:41,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:17:41,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:17:41,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:17:41,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:17:41,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:17:41,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:17:41,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:17:41,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: strspn_true-termination.c.i_Iteration5_Lasso [2018-11-18 09:17:41,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:17:41,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:17:41,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,580 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-18 09:17:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,583 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-18 09:17:41,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,585 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-18 09:17:41,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,587 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-18 09:17:41,830 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 09:17:41,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:41,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:17:42,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:17:42,255 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:17:42,256 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-18 09:17:42,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,258 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-18 09:17:42,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,260 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-18 09:17:42,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:42,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:42,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,262 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-18 09:17:42,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,264 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-18 09:17:42,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,265 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-18 09:17:42,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,266 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-18 09:17:42,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:17:42,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,268 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-18 09:17:42,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:17:42,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:42,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:42,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,273 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-18 09:17:42,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,274 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-18 09:17:42,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:17:42,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:17:42,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:17:42,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,276 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-18 09:17:42,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:42,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:42,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,278 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-18 09:17:42,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:42,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:42,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:17:42,283 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-18 09:17:42,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:17:42,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:17:42,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:17:42,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:17:42,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:17:42,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:17:42,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:17:42,332 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 09:17:42,333 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 09:17:42,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:17:42,334 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:17:42,334 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:17:42,334 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3, ULTIMATE.start_strspn_~a~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_3 - 1*ULTIMATE.start_strspn_~a~0.offset Supporting invariants [] [2018-11-18 09:17:42,442 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-18 09:17:42,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 09:17:42,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,508 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-18 09:17:42,509 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-18 09:17:42,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 09:17:42,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-18 09:17:42,552 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-18 09:17:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:17:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 09:17:42,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 09:17:42,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:42,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:17:42,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,645 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-18 09:17:42,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 09:17:42,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 09:17:42,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 6 states. [2018-11-18 09:17:42,686 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-18 09:17:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:17:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 09:17:42,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 09:17:42,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:42,686 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:17:42,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:17:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:17:42,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:17:42,760 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-18 09:17:42,760 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 09:17:42,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-18 09:17:42,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 57 transitions. Complement of second has 5 states. [2018-11-18 09:17:42,792 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-18 09:17:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 09:17:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-18 09:17:42,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 09:17:42,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:42,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-18 09:17:42,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:42,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-18 09:17:42,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:17:42,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-18 09:17:42,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:17:42,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-18 09:17:42,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:17:42,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:17:42,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:17:42,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:17:42,799 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:17:42,799 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:17:42,799 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:17:42,799 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:17:42,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:17:42,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:17:42,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:17:42,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:17:42 BoogieIcfgContainer [2018-11-18 09:17:42,806 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:17:42,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:17:42,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:17:42,807 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:17:42,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:17:37" (3/4) ... [2018-11-18 09:17:42,811 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:17:42,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:17:42,811 INFO L168 Benchmark]: Toolchain (without parser) took 5424.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -243.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:17:42,812 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-18 09:17:42,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:17:42,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.31 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:17:42,814 INFO L168 Benchmark]: Boogie Preprocessor took 16.16 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-18 09:17:42,815 INFO L168 Benchmark]: RCFGBuilder took 212.54 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:17:42,815 INFO L168 Benchmark]: BuchiAutomizer took 4822.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:17:42,819 INFO L168 Benchmark]: Witness Printer took 3.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:17:42,822 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 338.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.31 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.16 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. * RCFGBuilder took 212.54 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4822.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * a and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 128 SDslu, 44 SDs, 0 SdLazy, 78 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp94 ukn80 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...