./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 60847b137b78d6fc8305d5c5fcc8bf5228130e36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:02,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:02,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:02,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:02,220 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:02,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:02,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:02,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:02,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:02,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:02,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:02,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:02,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:02,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:02,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:02,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:02,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:02,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:02,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:02,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:02,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:02,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:02,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:02,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:02,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:02,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:02,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:02,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:02,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:02,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:02,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:02,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:02,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:02,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:02,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:02,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:02,274 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:02,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:02,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:02,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:02,307 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:02,307 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:02,307 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:02,308 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:02,308 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:02,308 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:02,309 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:02,309 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:02,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:02,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:02,309 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:02,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:02,310 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:02,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:02,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:02,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:02,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:02,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:02,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:02,313 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:02,313 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:02,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:02,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:02,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:02,315 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:02,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:02,315 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:02,315 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:02,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:02,317 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2018-11-29 00:11:02,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:02,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:02,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:02,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:02,395 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:02,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:02,445 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59f2da65/c54415a17a4e4a159a19bcc01274043e/FLAG4757d3cc0 [2018-11-29 00:11:02,998 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:03,000 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:03,020 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59f2da65/c54415a17a4e4a159a19bcc01274043e/FLAG4757d3cc0 [2018-11-29 00:11:03,305 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59f2da65/c54415a17a4e4a159a19bcc01274043e [2018-11-29 00:11:03,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:03,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:03,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:03,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:03,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:03,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:03,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7af74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03, skipping insertion in model container [2018-11-29 00:11:03,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:03,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:03,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:03,750 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:03,769 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:03,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:03,968 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:03,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03 WrapperNode [2018-11-29 00:11:03,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:03,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:03,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:03,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:03,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:04,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:04,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:04,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:04,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (1/1) ... [2018-11-29 00:11:04,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:04,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:04,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:04,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:04,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (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-29 00:11:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:04,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:04,589 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:04,589 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-29 00:11:04,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:04 BoogieIcfgContainer [2018-11-29 00:11:04,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:04,590 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:04,590 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:04,594 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:04,596 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:04,596 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:03" (1/3) ... [2018-11-29 00:11:04,597 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@763757d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:04, skipping insertion in model container [2018-11-29 00:11:04,597 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:04,597 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:03" (2/3) ... [2018-11-29 00:11:04,598 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@763757d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:04, skipping insertion in model container [2018-11-29 00:11:04,598 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:04,598 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:04" (3/3) ... [2018-11-29 00:11:04,600 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:04,659 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:04,659 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:04,660 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:04,660 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:04,660 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:04,660 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:04,660 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:04,660 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:04,661 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:04,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-29 00:11:04,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:04,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:04,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:04,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:04,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:04,704 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:04,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-29 00:11:04,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:04,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:04,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:04,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:04,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:04,716 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~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; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-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; 9#L543true assume !(0 == cstrncmp_~n); 15#L545-5true [2018-11-29 00:11:04,717 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 7#L545-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; 12#L545-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 5#L546true assume cstrncmp_#t~short7; 8#L546-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;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; 15#L545-5true [2018-11-29 00:11:04,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-11-29 00:11:04,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:04,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:04,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:04,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2018-11-29 00:11:04,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:04,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:04,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:04,960 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-29 00:11:04,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:04,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:04,967 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:04,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:11:04,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:11:04,985 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-11-29 00:11:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:05,074 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-11-29 00:11:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:11:05,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-29 00:11:05,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:05,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2018-11-29 00:11:05,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:11:05,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:11:05,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-29 00:11:05,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:05,085 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-29 00:11:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-29 00:11:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:11:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-29 00:11:05,115 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:05,116 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:05,116 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:05,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-29 00:11:05,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:05,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:05,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:05,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:11:05,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:05,118 INFO L794 eck$LassoCheckResult]: Stem: 51#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#L558 assume !(main_~length1~0 < 1); 50#L558-2 assume !(main_~length2~0 < 1); 55#L561-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#L543 assume !(0 == cstrncmp_~n); 53#L545-5 [2018-11-29 00:11:05,118 INFO L796 eck$LassoCheckResult]: Loop: 53#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 54#L545-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; 48#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 49#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 52#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;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; 53#L545-5 [2018-11-29 00:11:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2018-11-29 00:11:05,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:05,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2018-11-29 00:11:05,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:05,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2018-11-29 00:11:05,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:05,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:05,992 WARN L180 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-11-29 00:11:06,872 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-11-29 00:11:07,079 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-29 00:11:07,094 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:07,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:07,096 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:07,096 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:07,096 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:07,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:07,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:07,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:07,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:11:07,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:07,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:07,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,139 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-29 00:11:07,149 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-29 00:11:07,152 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-29 00:11:07,158 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-29 00:11:07,166 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-29 00:11:07,171 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-29 00:11:07,175 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-29 00:11:07,626 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-29 00:11:07,803 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-29 00:11:07,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,806 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-29 00:11:07,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,823 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-29 00:11:07,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:07,830 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-29 00:11:07,833 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-29 00:11:07,850 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-29 00:11:07,852 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-29 00:11:07,854 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-29 00:11:07,857 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-29 00:11:07,884 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-29 00:11:07,886 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-29 00:11:07,894 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-29 00:11:07,896 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-29 00:11:08,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:08,763 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:08,766 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-29 00:11:08,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,776 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-29 00:11:08,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,781 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-29 00:11:08,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,787 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-29 00:11:08,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,797 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-29 00:11:08,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,803 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-29 00:11:08,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,811 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-29 00:11:08,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:08,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,817 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-29 00:11:08,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:08,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,818 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:11:08,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:11:08,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:08,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,826 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-29 00:11:08,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,847 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-29 00:11:08,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,854 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-29 00:11:08,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,862 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-29 00:11:08,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:08,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,873 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:08,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,887 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:08,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,926 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-29 00:11:08,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,939 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-29 00:11:08,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:08,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:08,966 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-29 00:11:08,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:08,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:08,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:08,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:08,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:08,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:09,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:09,153 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:11:09,153 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-29 00:11:09,156 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:09,158 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:09,158 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:09,159 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-11-29 00:11:09,479 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-29 00:11:09,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:09,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:09,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:09,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:09,763 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-29 00:11:09,767 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-29 00:11:09,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-29 00:11:09,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 31 transitions. Complement of second has 7 states. [2018-11-29 00:11:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:11:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-29 00:11:09,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-29 00:11:09,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:09,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-29 00:11:09,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:09,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-29 00:11:09,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:09,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:11:09,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:09,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2018-11-29 00:11:09,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:11:09,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:11:09,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-29 00:11:09,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:09,940 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-29 00:11:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-29 00:11:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-29 00:11:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-29 00:11:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-29 00:11:09,943 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-29 00:11:09,943 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-29 00:11:09,943 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:09,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-29 00:11:09,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:11:09,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:09,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:09,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:09,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:09,945 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#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; 211#L558 assume !(main_~length1~0 < 1); 216#L558-2 assume !(main_~length2~0 < 1); 224#L561-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; 226#L543 assume !(0 == cstrncmp_~n); 228#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-11-29 00:11:09,945 INFO L796 eck$LassoCheckResult]: Loop: 221#L545-1 assume !cstrncmp_#t~short5; 212#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~short5;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 213#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 218#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;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; 220#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-11-29 00:11:09,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-29 00:11:09,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:09,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2018-11-29 00:11:09,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:09,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:10,023 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-29 00:11:10,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:10,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:10,024 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:10,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:11:10,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:11:10,026 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:11:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:10,061 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-29 00:11:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:11:10,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-29 00:11:10,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:10,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-29 00:11:10,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:10,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:10,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:10,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:10,064 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:10,064 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:10,064 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:10,064 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:10,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:10,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:10,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:10,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:10 BoogieIcfgContainer [2018-11-29 00:11:10,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:10,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:10,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:10,076 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:10,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:04" (3/4) ... [2018-11-29 00:11:10,081 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:10,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:10,082 INFO L168 Benchmark]: Toolchain (without parser) took 6769.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 63.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:10,084 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:10,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:10,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.23 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-29 00:11:10,086 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 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-29 00:11:10,087 INFO L168 Benchmark]: RCFGBuilder took 524.81 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:10,089 INFO L168 Benchmark]: BuchiAutomizer took 5483.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:10,092 INFO L168 Benchmark]: Witness Printer took 5.81 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-29 00:11:10,099 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.23 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. * Boogie Preprocessor took 38.30 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 524.81 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5483.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.81 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 14 SDslu, 40 SDs, 0 SdLazy, 18 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp44 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms 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...