./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-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 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:20:19,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:20:19,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:20:19,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:20:19,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:20:19,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:20:19,561 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:20:19,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:20:19,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:20:19,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:20:19,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:20:19,570 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:20:19,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:20:19,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:20:19,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:20:19,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:20:19,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:20:19,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:20:19,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:20:19,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:20:19,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:20:19,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:20:19,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:20:19,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:20:19,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:20:19,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:20:19,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:20:19,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:20:19,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:20:19,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:20:19,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:20:19,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:20:19,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:20:19,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:20:19,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:20:19,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:20:19,593 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:20:19,619 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:20:19,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:20:19,620 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:20:19,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:20:19,621 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:20:19,621 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:20:19,621 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:20:19,621 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:20:19,621 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:20:19,622 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:20:19,622 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:20:19,622 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:20:19,622 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:20:19,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:20:19,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:20:19,623 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:20:19,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:20:19,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:20:19,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:20:19,624 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:20:19,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:20:19,625 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:20:19,625 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:20:19,626 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:20:19,626 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 -> 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 [2018-11-28 23:20:19,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:20:19,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:20:19,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:20:19,713 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:20:19,713 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:20:19,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2018-11-28 23:20:19,780 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e2c4437/d6173a9c3a9441a6a028536856db5aa0/FLAG219b4709e [2018-11-28 23:20:20,304 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:20:20,305 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrncmp-alloca_true-termination.c.i [2018-11-28 23:20:20,319 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e2c4437/d6173a9c3a9441a6a028536856db5aa0/FLAG219b4709e [2018-11-28 23:20:20,603 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e2c4437/d6173a9c3a9441a6a028536856db5aa0 [2018-11-28 23:20:20,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:20:20,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:20:20,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:20,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:20:20,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:20:20,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:20" (1/1) ... [2018-11-28 23:20:20,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9ff21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:20, skipping insertion in model container [2018-11-28 23:20:20,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:20" (1/1) ... [2018-11-28 23:20:20,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:20:20,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:20:21,012 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:21,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:20:21,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:21,290 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:20:21,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21 WrapperNode [2018-11-28 23:20:21,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:21,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:21,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:20:21,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:20:21,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:21,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:20:21,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:20:21,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:20:21,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (1/1) ... [2018-11-28 23:20:21,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:20:21,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:20:21,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:20:21,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:20:21,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20: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 [2018-11-28 23:20:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:20:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:20:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:20:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:20:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:20:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:20:21,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:20:21,923 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:20:21,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:21 BoogieIcfgContainer [2018-11-28 23:20:21,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:20:21,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:20:21,926 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:20:21,930 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:20:21,930 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:21,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:20:20" (1/3) ... [2018-11-28 23:20:21,932 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53ca8987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:21, skipping insertion in model container [2018-11-28 23:20:21,932 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:21,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:21" (2/3) ... [2018-11-28 23:20:21,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53ca8987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:21, skipping insertion in model container [2018-11-28 23:20:21,934 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:21,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:21" (3/3) ... [2018-11-28 23:20:21,936 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-termination.c.i [2018-11-28 23:20:21,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:20:21,993 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:20:21,993 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:20:21,993 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:20:21,994 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:20:21,994 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:20:21,994 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:20:21,994 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:20:21,994 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:20:22,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:20:22,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:22,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:22,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:22,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:22,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:22,044 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:20:22,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:20:22,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:22,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:22,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:22,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:22,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:22,057 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 8#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 17#L550true assume !(0 == cstrncmp_~n); 4#L552-5true [2018-11-28 23:20:22,057 INFO L796 eck$LassoCheckResult]: Loop: 4#L552-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 14#L552-1true assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 20#L552-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 11#L553true assume cstrncmp_#t~short7; 15#L553-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 4#L552-5true [2018-11-28 23:20:22,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-11-28 23:20:22,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:22,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2018-11-28 23:20:22,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:22,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:22,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:20:22,335 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:20:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:20:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:20:22,353 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-28 23:20:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:22,406 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-11-28 23:20:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:20:22,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 23:20:22,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:22,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2018-11-28 23:20:22,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:20:22,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:20:22,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 23:20:22,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:22,418 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 23:20:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:20:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:20:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-28 23:20:22,447 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:22,447 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:20:22,447 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:20:22,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-28 23:20:22,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:22,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:22,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:22,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:22,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:22,449 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L565 assume !(main_~length1~0 < 1); 53#L565-2 assume !(main_~length2~0 < 1); 54#L568-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L550 assume !(0 == cstrncmp_~n); 50#L552-5 [2018-11-28 23:20:22,449 INFO L796 eck$LassoCheckResult]: Loop: 50#L552-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 51#L552-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 55#L552-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 48#L553 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 49#L553-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 50#L552-5 [2018-11-28 23:20:22,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2018-11-28 23:20:22,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:22,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2018-11-28 23:20:22,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2018-11-28 23:20:22,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:23,390 WARN L180 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-11-28 23:20:24,248 WARN L180 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-11-28 23:20:24,435 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 23:20:24,455 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:24,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:24,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:24,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:24,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:24,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:24,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:24,458 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:24,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:20:24,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:24,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:24,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:24,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,075 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 23:20:25,306 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 23:20:25,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:25,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:26,391 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:26,397 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:26,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 [2018-11-28 23:20:26,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,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 [2018-11-28 23:20:26,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,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 [2018-11-28 23:20:26,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,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 [2018-11-28 23:20:26,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:26,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:26,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:20:26,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:20:26,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:26,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:26,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:26,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:26,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:26,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:26,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:26,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:26,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:26,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:26,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:26,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:26,709 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:26,709 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:20:26,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:26,714 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:26,714 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:26,715 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s1.offset, v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1) = -1*ULTIMATE.start_cstrncmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s1.base)_1 Supporting invariants [] [2018-11-28 23:20:27,012 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:20:27,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:20:27,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:27,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:27,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:27,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:20:27,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:20:27,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 20 states and 25 transitions. Complement of second has 6 states. [2018-11-28 23:20:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-28 23:20:27,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-28 23:20:27,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:27,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 23:20:27,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:27,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-28 23:20:27,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:27,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-11-28 23:20:27,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:27,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-28 23:20:27,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:27,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:27,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:27,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:27,235 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:27,235 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:27,235 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:27,235 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:27,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:27,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:27,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:27,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:27 BoogieIcfgContainer [2018-11-28 23:20:27,245 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:27,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:27,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:27,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:27,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:21" (3/4) ... [2018-11-28 23:20:27,251 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:27,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:27,252 INFO L168 Benchmark]: Toolchain (without parser) took 6644.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:27,254 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:27,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:27,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:27,257 INFO L168 Benchmark]: Boogie Preprocessor took 46.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:27,257 INFO L168 Benchmark]: RCFGBuilder took 519.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:27,258 INFO L168 Benchmark]: BuchiAutomizer took 5319.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.3 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:27,259 INFO L168 Benchmark]: Witness Printer took 6.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:27,265 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 681.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 519.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5319.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -41.3 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[s1] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 16 SDslu, 25 SDs, 0 SdLazy, 11 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax107 hnf99 lsp81 ukn85 mio100 lsp44 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 4 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...