./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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-memory-alloca/cstrcspn-alloca_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 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:32:19,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:32:19,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:32:19,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:32:19,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:32:19,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:32:19,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:32:19,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:32:19,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:32:19,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:32:19,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:32:19,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:32:19,836 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:32:19,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:32:19,839 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:32:19,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:32:19,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:32:19,851 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:32:19,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:32:19,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:32:19,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:32:19,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:32:19,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:32:19,865 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:32:19,865 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:32:19,866 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:32:19,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:32:19,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:32:19,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:32:19,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:32:19,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:32:19,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:32:19,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:32:19,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:32:19,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:32:19,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:32:19,877 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:32:19,903 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:32:19,903 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:32:19,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:32:19,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:32:19,905 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:32:19,906 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:32:19,906 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:32:19,906 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:32:19,906 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:32:19,906 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:32:19,906 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:32:19,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:32:19,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:32:19,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:32:19,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:32:19,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:32:19,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:32:19,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:32:19,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:32:19,913 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:32:19,913 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:32:19,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:32:19,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:32:19,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:32:19,914 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:32:19,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:32:19,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:32:19,914 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:32:19,915 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:32:19,916 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 -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2019-01-14 02:32:19,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:32:19,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:32:19,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:32:19,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:32:19,978 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:32:19,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2019-01-14 02:32:20,038 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637ee3a3/53bdd29d20244a8699d594b2bd9fc49a/FLAG023a39269 [2019-01-14 02:32:20,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:32:20,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2019-01-14 02:32:20,515 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637ee3a3/53bdd29d20244a8699d594b2bd9fc49a/FLAG023a39269 [2019-01-14 02:32:20,825 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d637ee3a3/53bdd29d20244a8699d594b2bd9fc49a [2019-01-14 02:32:20,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:32:20,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:32:20,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:20,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:32:20,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:32:20,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:20" (1/1) ... [2019-01-14 02:32:20,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3540f96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:20, skipping insertion in model container [2019-01-14 02:32:20,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:20" (1/1) ... [2019-01-14 02:32:20,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:32:20,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:32:21,345 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:21,360 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:32:21,486 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:21,547 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:32:21,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21 WrapperNode [2019-01-14 02:32:21,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:21,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:21,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:32:21,549 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:32:21,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:21,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:32:21,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:32:21,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:32:21,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (1/1) ... [2019-01-14 02:32:21,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:32:21,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:32:21,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:32:21,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:32:21,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (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 [2019-01-14 02:32:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:32:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:32:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:32:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:32:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:32:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:32:22,179 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:32:22,179 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:32:22,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:22 BoogieIcfgContainer [2019-01-14 02:32:22,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:32:22,181 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:32:22,181 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:32:22,185 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:32:22,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:22,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:32:20" (1/3) ... [2019-01-14 02:32:22,187 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed5141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:22, skipping insertion in model container [2019-01-14 02:32:22,187 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:22,188 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:21" (2/3) ... [2019-01-14 02:32:22,188 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ed5141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:22, skipping insertion in model container [2019-01-14 02:32:22,188 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:22,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:22" (3/3) ... [2019-01-14 02:32:22,190 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-termination.c.i [2019-01-14 02:32:22,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:32:22,246 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:32:22,246 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:32:22,246 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:32:22,247 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:32:22,247 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:32:22,248 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:32:22,248 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:32:22,248 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:32:22,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:32:22,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:32:22,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:22,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:22,291 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:22,291 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:32:22,291 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:32:22,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:32:22,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:32:22,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:22,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:22,295 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:22,295 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:32:22,304 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L552-4true [2019-01-14 02:32:22,304 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 20#L552-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L552-4true [2019-01-14 02:32:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:32:22,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 02:32:22,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:32:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:32:22,517 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:32:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:32:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:32:22,535 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 02:32:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:32:22,542 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 02:32:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:32:22,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 02:32:22,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:32:22,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 02:32:22,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:32:22,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:32:22,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:32:22,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:22,553 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:32:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:32:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:32:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:32:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:32:22,576 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:32:22,576 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:32:22,576 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:32:22,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:32:22,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:32:22,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:22,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:22,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:22,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:22,578 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 44#L552-4 [2019-01-14 02:32:22,578 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 51#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 55#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 46#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 47#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 44#L552-4 [2019-01-14 02:32:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:32:22,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:22,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 02:32:22,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 02:32:22,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:22,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:23,359 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-14 02:32:24,233 WARN L181 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-14 02:32:24,614 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 02:32:24,762 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:32:24,775 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:24,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:24,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:24,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:24,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:24,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:24,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:24,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:24,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:32:24,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:24,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:24,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:24,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,241 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-14 02:32:25,596 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:32:25,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:25,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:26,536 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:32:26,652 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:32:27,039 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-14 02:32:27,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:27,180 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:27,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 [2019-01-14 02:32:27,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:27,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:27,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:27,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:27,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:27,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:27,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:27,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:27,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,212 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 [2019-01-14 02:32:27,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:27,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:27,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:27,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,218 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 [2019-01-14 02:32:27,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,219 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:32:27,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,242 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:27,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,337 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 [2019-01-14 02:32:27,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,346 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 [2019-01-14 02:32:27,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,369 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 [2019-01-14 02:32:27,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:27,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,372 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-14 02:32:27,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,376 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:32:27,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:27,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,396 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 [2019-01-14 02:32:27,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,418 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 [2019-01-14 02:32:27,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:27,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:27,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:27,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:27,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,436 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 [2019-01-14 02:32:27,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:27,441 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 [2019-01-14 02:32:27,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:27,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:27,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:27,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:27,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:27,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:27,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:27,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:32:27,509 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:32:27,512 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:27,514 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:27,514 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:27,515 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-01-14 02:32:27,693 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:32:27,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:27,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:27,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:27,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:32:27,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:32:27,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 02:32:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:32:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 02:32:27,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:32:27,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:27,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 02:32:27,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:27,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 02:32:27,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:27,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 02:32:27,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:32:27,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 02:32:27,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:32:27,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:32:27,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 02:32:27,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:27,984 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:32:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 02:32:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:32:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:32:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 02:32:27,987 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:32:27,987 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:32:27,987 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:32:27,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 02:32:27,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:32:27,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:27,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:27,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:27,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:32:27,989 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 193#L555-5 [2019-01-14 02:32:27,989 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 187#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 193#L555-5 [2019-01-14 02:32:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 02:32:27,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:27,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:27,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:28,018 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 02:32:28,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:28,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:28,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:28,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:28,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 02:32:28,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:28,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:28,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:28,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:28,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:28,504 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:32:28,653 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:32:29,003 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-14 02:32:29,216 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-14 02:32:29,221 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:29,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:29,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:29,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:29,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:29,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:29,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:29,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:29,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:32:29,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:29,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:29,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,728 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-14 02:32:29,891 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 02:32:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:29,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:30,716 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:32:31,347 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:32:31,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:31,391 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:31,391 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 [2019-01-14 02:32:31,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:31,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,399 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 [2019-01-14 02:32:31,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,407 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 [2019-01-14 02:32:31,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,413 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 [2019-01-14 02:32:31,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,418 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 [2019-01-14 02:32:31,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:31,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,433 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 [2019-01-14 02:32:31,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,438 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 [2019-01-14 02:32:31,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,445 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 [2019-01-14 02:32:31,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,447 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 [2019-01-14 02:32:31,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,455 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 [2019-01-14 02:32:31,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,459 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 [2019-01-14 02:32:31,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:31,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:31,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:31,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,464 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 [2019-01-14 02:32:31,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:31,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,484 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 [2019-01-14 02:32:31,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:31,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,496 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 [2019-01-14 02:32:31,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,503 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 [2019-01-14 02:32:31,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,505 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:32:31,505 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:32:31,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,537 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-14 02:32:31,538 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 02:32:31,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:31,655 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 [2019-01-14 02:32:31,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:31,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:31,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:31,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:31,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:31,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:31,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:31,717 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:32:31,717 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:32:31,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:31,718 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:31,719 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:31,719 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-01-14 02:32:31,971 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:32:31,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:32,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:32,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:32,145 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 [2019-01-14 02:32:32,145 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 02:32:32,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-14 02:32:32,378 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 [2019-01-14 02:32:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:32:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:32:32,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:32:32,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:32,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:32:32,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:32,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:32:32,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:32,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 02:32:32,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:32:32,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 02:32:32,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:32:32,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:32:32,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 02:32:32,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:32:32,384 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 02:32:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 02:32:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 02:32:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:32:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 02:32:32,388 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:32:32,388 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:32:32,388 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:32:32,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 02:32:32,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:32:32,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:32,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:32,390 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:32,390 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:32:32,390 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 358#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 359#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 375#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L555-1 assume !cstrcspn_#t~short7; 379#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 378#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 363#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 364#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 360#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 362#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 374#L555-5 [2019-01-14 02:32:32,390 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 368#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 369#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 374#L555-5 [2019-01-14 02:32:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 02:32:32,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 02:32:32,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:32,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-14 02:32:32,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:32:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:32,772 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:32:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:32:33,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:32:33,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:32:33,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:33,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:33,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-01-14 02:32:33,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 02:32:33,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:33,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-14 02:32:33,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 02:32:33,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:33,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-14 02:32:33,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:32:33,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:33,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:32:33,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-14 02:32:33,486 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-01-14 02:33:11,234 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:33:37,111 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:33:52,777 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:33:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:33:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:33:52,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 02:33:53,162 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:33:53,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:33:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-01-14 02:33:53,164 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-14 02:33:57,337 WARN L181 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-14 02:34:00,556 WARN L181 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-14 02:34:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:34:00,668 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-14 02:34:00,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:34:00,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-14 02:34:00,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:34:00,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-14 02:34:00,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:34:00,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:34:00,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-14 02:34:00,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:34:00,675 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-14 02:34:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-14 02:34:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-14 02:34:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:34:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 02:34:00,680 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:34:00,680 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:34:00,680 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:34:00,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-14 02:34:00,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:34:00,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:34:00,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:34:00,682 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:34:00,683 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:34:00,683 INFO L794 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 533#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 527#L565 assume !(main_~length1~0 < 1); 528#L565-2 assume !(main_~length2~0 < 1); 526#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 519#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 520#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 538#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 531#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 532#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5; 541#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 524#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 525#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 521#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 523#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 535#L555-5 [2019-01-14 02:34:00,684 INFO L796 eck$LassoCheckResult]: Loop: 535#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 529#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 530#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 535#L555-5 [2019-01-14 02:34:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 02:34:00,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:00,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:34:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 02:34:00,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:00,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 02:34:00,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:34:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:34:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:34:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:34:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:34:01,241 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:34:01,357 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:34:02,030 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2019-01-14 02:34:03,277 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-14 02:34:03,279 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:34:03,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:34:03,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:34:03,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:34:03,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:34:03,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:34:03,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:34:03,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:34:03,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:34:03,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:34:03,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:34:03,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:03,554 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:34:04,573 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-01-14 02:34:04,770 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 02:34:04,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:04,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:34:05,313 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-14 02:34:06,107 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:34:06,877 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-14 02:34:07,092 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:34:07,116 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:34:07,117 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:34:07,118 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 [2019-01-14 02:34:07,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,124 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 [2019-01-14 02:34:07,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,131 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 [2019-01-14 02:34:07,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:07,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:07,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,137 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 [2019-01-14 02:34:07,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,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 [2019-01-14 02:34:07,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,149 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 [2019-01-14 02:34:07,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,153 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 [2019-01-14 02:34:07,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:07,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:07,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,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 [2019-01-14 02:34:07,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:34:07,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:34:07,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:34:07,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:34:07,164 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 [2019-01-14 02:34:07,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:34:07,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:34:07,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:34:07,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:34:07,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:34:07,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:34:07,196 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:34:07,207 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:34:07,207 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:34:07,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:34:07,210 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:34:07,210 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:34:07,210 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-01-14 02:34:07,428 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-01-14 02:34:07,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:34:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:07,504 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 [2019-01-14 02:34:07,504 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:34:07,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-14 02:34:07,555 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 [2019-01-14 02:34:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:34:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:34:07,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:34:07,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:07,556 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:07,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:34:07,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:34:07,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-14 02:34:07,684 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 [2019-01-14 02:34:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:34:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 02:34:07,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:34:07,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:07,685 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:34:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:34:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:34:07,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:34:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:34:07,778 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:34:07,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 02:34:07,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2019-01-14 02:34:07,830 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 [2019-01-14 02:34:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:34:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:34:07,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:34:07,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:07,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:34:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:07,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:34:07,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:34:07,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-14 02:34:07,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:07,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-14 02:34:07,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:34:07,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:34:07,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:34:07,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:34:07,836 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:07,836 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:07,836 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:34:07,836 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:34:07,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:34:07,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:34:07,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:34:07,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:34:07 BoogieIcfgContainer [2019-01-14 02:34:07,843 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:34:07,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:34:07,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:34:07,844 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:34:07,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:22" (3/4) ... [2019-01-14 02:34:07,848 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:34:07,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:34:07,849 INFO L168 Benchmark]: Toolchain (without parser) took 107019.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 952.7 MB in the beginning and 991.4 MB in the end (delta: -38.7 MB). Peak memory consumption was 266.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:07,850 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. [2019-01-14 02:34:07,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:07,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:07,852 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:07,853 INFO L168 Benchmark]: RCFGBuilder took 541.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:07,854 INFO L168 Benchmark]: BuchiAutomizer took 105662.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 991.4 MB in the end (delta: 41.7 MB). Peak memory consumption was 265.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:34:07,854 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.3 GB. Free memory is still 991.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:34:07,859 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 716.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -112.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 541.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 105662.36 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 1.0 GB in the beginning and 991.4 MB in the end (delta: 41.7 MB). Peak memory consumption was 265.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.3 GB. Free memory is still 991.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 105.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 96.8s. Construction of modules took 0.3s. Büchi inclusion checks took 8.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 151 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp30 div135 bol100 ite100 ukn100 eq159 hnf81 smp91 dnf1042 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 149ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...