./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:18:00,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:00,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:00,949 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:00,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:00,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:00,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:00,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:00,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:00,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:00,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:00,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:00,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:00,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:00,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:00,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:00,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:00,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:00,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:00,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:00,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:00,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:00,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:00,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:00,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:00,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:00,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:00,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:00,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:00,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:00,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:00,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:00,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:00,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:00,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:00,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:00,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:01,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:01,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:01,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:01,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:01,003 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:01,003 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:01,004 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:01,004 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:01,004 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:01,004 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:01,004 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:01,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:01,006 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:01,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:01,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:01,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:01,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:01,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:01,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:01,010 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:01,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:01,010 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:01,010 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:01,011 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:01,011 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2018-11-28 23:18:01,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:01,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:01,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:01,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:01,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:01,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i [2018-11-28 23:18:01,133 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f689cc145/bf494bb4c88f492182578481198cf427/FLAGd62fd6897 [2018-11-28 23:18:01,631 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:01,632 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strdup_true-termination.c.i [2018-11-28 23:18:01,645 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f689cc145/bf494bb4c88f492182578481198cf427/FLAGd62fd6897 [2018-11-28 23:18:01,917 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f689cc145/bf494bb4c88f492182578481198cf427 [2018-11-28 23:18:01,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:01,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:01,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:01,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:01,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:01,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:01" (1/1) ... [2018-11-28 23:18:01,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b925899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:01, skipping insertion in model container [2018-11-28 23:18:01,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:01" (1/1) ... [2018-11-28 23:18:01,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:01,983 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:02,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:02,431 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:02,482 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:02,630 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:02,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02 WrapperNode [2018-11-28 23:18:02,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:02,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:02,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:02,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:02,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:02,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:02,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:02,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:02,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:02,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:02,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:02,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:02,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:18:02,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:02,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:02,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:02,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:02,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:03,222 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:03,222 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-28 23:18:03,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:03 BoogieIcfgContainer [2018-11-28 23:18:03,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:03,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:03,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:03,227 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:03,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:03,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:01" (1/3) ... [2018-11-28 23:18:03,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a97c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:03, skipping insertion in model container [2018-11-28 23:18:03,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:03,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02" (2/3) ... [2018-11-28 23:18:03,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19a97c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:03, skipping insertion in model container [2018-11-28 23:18:03,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:03,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:03" (3/3) ... [2018-11-28 23:18:03,232 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-11-28 23:18:03,289 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:03,290 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:03,290 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:03,290 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:03,290 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:03,291 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:03,291 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:03,291 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:03,291 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:03,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:18:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:18:03,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:03,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:03,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:03,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:03,343 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:03,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:18:03,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:18:03,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:03,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:03,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:03,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:03,355 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L528true assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-4true [2018-11-28 23:18:03,355 INFO L796 eck$LassoCheckResult]: Loop: 7#L517-4true call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4#L517-1true assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 5#L517-3true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-4true [2018-11-28 23:18:03,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:18:03,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:03,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:03,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2018-11-28 23:18:03,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:03,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:03,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:03,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906826, now seen corresponding path program 1 times [2018-11-28 23:18:03,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:03,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,282 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-11-28 23:18:04,398 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-28 23:18:04,423 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:04,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:04,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:04,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:04,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:04,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:04,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:04,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:04,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:04,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:04,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:04,456 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-28 23:18:04,475 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-28 23:18:04,481 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-28 23:18:04,484 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-28 23:18:04,490 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-28 23:18:04,494 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-28 23:18:04,500 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-28 23:18:04,529 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-28 23:18:04,557 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-28 23:18:04,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-28 23:18:04,608 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-28 23:18:04,647 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-28 23:18:04,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,700 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-28 23:18:04,727 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-28 23:18:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:04,778 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-28 23:18:05,143 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-28 23:18:05,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,277 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-28 23:18:05,292 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-28 23:18:05,298 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-28 23:18:05,300 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-28 23:18:05,304 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-28 23:18:05,828 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 23:18:05,982 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 23:18:06,028 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:06,034 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:06,036 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-28 23:18:06,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,046 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-28 23:18:06,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,050 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-28 23:18:06,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,056 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-28 23:18:06,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,061 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-28 23:18:06,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,069 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-28 23:18:06,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,080 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-28 23:18:06,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,086 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-28 23:18:06,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,091 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-28 23:18:06,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,096 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-28 23:18:06,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,122 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-28 23:18:06,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,134 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-28 23:18:06,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,139 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-28 23:18:06,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,144 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-28 23:18:06,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,151 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-28 23:18:06,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,157 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-28 23:18:06,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,163 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-28 23:18:06,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,166 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:06,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:06,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,182 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-28 23:18:06,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,226 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-28 23:18:06,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:06,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,237 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:06,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,281 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-28 23:18:06,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,337 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:06,368 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:06,368 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:06,373 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:06,378 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:06,379 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:06,380 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-11-28 23:18:06,425 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:18:06,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:06,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:06,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:06,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:06,595 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-28 23:18:06,610 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-28 23:18:06,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-28 23:18:06,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 45 states and 57 transitions. Complement of second has 7 states. [2018-11-28 23:18:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-28 23:18:06,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:18:06,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:06,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:18:06,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:06,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:18:06,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:06,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2018-11-28 23:18:06,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:18:06,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2018-11-28 23:18:06,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:06,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:18:06,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 23:18:06,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:06,745 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 23:18:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 23:18:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-11-28 23:18:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:18:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 23:18:06,771 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:06,771 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:06,771 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:06,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-28 23:18:06,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:06,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:06,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:06,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:06,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:06,774 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 137#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 138#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 139#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 145#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 142#L511-3 [2018-11-28 23:18:06,774 INFO L796 eck$LassoCheckResult]: Loop: 142#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 141#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 142#L511-3 [2018-11-28 23:18:06,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash 889569803, now seen corresponding path program 1 times [2018-11-28 23:18:06,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:06,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:06,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:06,850 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-28 23:18:06,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:06,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:06,854 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:06,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 1 times [2018-11-28 23:18:06,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:06,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:06,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:18:07,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:18:07,051 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:18:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:07,081 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-28 23:18:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:18:07,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-28 23:18:07,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:07,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 23:18:07,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:18:07,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:18:07,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 23:18:07,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:07,085 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:18:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 23:18:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:18:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:18:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 23:18:07,089 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:18:07,089 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:18:07,090 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:07,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-28 23:18:07,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:07,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:07,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:07,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:07,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:07,091 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 168#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 169#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 170#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 171#L517-5 strlen_#res := strlen_~i~0; 178#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 179#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 175#L511-3 [2018-11-28 23:18:07,092 INFO L796 eck$LassoCheckResult]: Loop: 175#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 174#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~mem5; 175#L511-3 [2018-11-28 23:18:07,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1270617397, now seen corresponding path program 1 times [2018-11-28 23:18:07,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:07,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:07,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 2 times [2018-11-28 23:18:07,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:07,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:07,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:07,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1292607706, now seen corresponding path program 1 times [2018-11-28 23:18:07,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:07,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:07,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:07,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:07,988 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-28 23:18:08,166 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 23:18:08,188 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:08,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:08,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:08,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:08,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:08,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:08,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:08,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:08,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:08,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:08,189 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:08,198 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-28 23:18:08,212 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-28 23:18:08,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,226 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-28 23:18:08,230 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-28 23:18:08,232 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-28 23:18:08,234 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-28 23:18:08,237 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-28 23:18:08,240 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-28 23:18:08,242 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-28 23:18:08,243 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-28 23:18:08,246 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-28 23:18:08,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,264 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-28 23:18:08,266 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-28 23:18:09,259 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2018-11-28 23:18:09,454 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 23:18:09,455 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-28 23:18:09,457 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-28 23:18:09,889 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-11-28 23:18:10,050 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 23:18:10,507 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 23:18:10,832 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:18:10,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:10,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:10,894 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-28 23:18:10,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,900 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-28 23:18:10,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,905 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-28 23:18:10,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:10,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,915 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-28 23:18:10,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,921 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-28 23:18:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:10,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:10,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:10,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:10,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:10,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,938 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-28 23:18:10,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,946 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-28 23:18:10,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,956 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-28 23:18:10,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,958 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-28 23:18:10,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:10,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:10,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,984 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-28 23:18:10,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:10,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:10,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:10,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:10,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:10,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:10,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:10,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:10,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:10,999 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-28 23:18:11,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:11,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:11,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,010 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-28 23:18:11,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,014 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-28 23:18:11,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,020 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-28 23:18:11,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,025 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-28 23:18:11,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,031 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-28 23:18:11,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,036 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-28 23:18:11,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,044 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-28 23:18:11,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:11,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:11,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,058 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-28 23:18:11,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:11,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:11,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:11,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:11,060 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-28 23:18:11,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:11,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:11,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:11,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:11,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:11,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:11,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:11,229 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:18:11,231 INFO L444 ModelExtractionUtils]: 70 out of 76 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:18:11,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:11,233 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:11,233 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:11,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcpy_~c1~0.offset, v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1) = -1*ULTIMATE.start_memcpy_~c1~0.offset + 1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1 Supporting invariants [] [2018-11-28 23:18:11,566 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 23:18:11,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:11,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:11,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:11,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:11,651 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-28 23:18:11,652 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-28 23:18:11,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:18:11,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 5 states. [2018-11-28 23:18:11,803 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-28 23:18:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-28 23:18:11,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:18:11,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:11,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:18:11,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:11,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:18:11,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:11,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-28 23:18:11,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:11,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-28 23:18:11,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:11,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:11,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:11,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:11,806 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:11,807 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:11,807 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:11,807 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:11,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:11,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:11,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:11,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:11 BoogieIcfgContainer [2018-11-28 23:18:11,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:11,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:11,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:11,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:11,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:03" (3/4) ... [2018-11-28 23:18:11,828 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:11,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:11,829 INFO L168 Benchmark]: Toolchain (without parser) took 9908.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -270.8 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:11,831 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:11,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:11,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.41 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:11,833 INFO L168 Benchmark]: Boogie Preprocessor took 42.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:11,834 INFO L168 Benchmark]: RCFGBuilder took 485.24 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:11,834 INFO L168 Benchmark]: BuchiAutomizer took 8598.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.4 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:11,835 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:11,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 708.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.41 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.24 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8598.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.4 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * c1 + unknown-#length-unknown[malloc(l)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 18 SDs, 0 SdLazy, 17 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf100 lsp92 ukn94 mio100 lsp50 div114 bol100 ite100 ukn100 eq190 hnf83 smp94 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...