./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 025e0289c8e9b33528493c96bf0a22ba3200731b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:35:54,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:35:54,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:35:54,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:35:54,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:35:54,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:35:54,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:35:54,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:35:54,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:35:54,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:35:54,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:35:54,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:35:54,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:35:54,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:35:54,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:35:54,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:35:54,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:35:54,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:35:54,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:35:54,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:35:54,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:35:54,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:35:54,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:35:54,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:35:54,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:35:54,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:35:54,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:35:54,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:35:54,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:35:54,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:35:54,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:35:54,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:35:54,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:35:54,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:35:54,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:35:54,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:35:54,337 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 14:35:54,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:35:54,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:35:54,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:35:54,345 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:35:54,345 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:35:54,346 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 14:35:54,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:35:54,346 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:35:54,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 14:35:54,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 14:35:54,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:35:54,348 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:35:54,349 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 14:35:54,349 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 14:35:54,349 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2018-12-08 14:35:54,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:35:54,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:35:54,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:35:54,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:35:54,375 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:35:54,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-08 14:35:54,409 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/data/f38fc294d/68317836fea7408f84d92b551d773671/FLAGaa553856b [2018-12-08 14:35:54,734 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:35:54,734 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-08 14:35:54,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/data/f38fc294d/68317836fea7408f84d92b551d773671/FLAGaa553856b [2018-12-08 14:35:55,174 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/data/f38fc294d/68317836fea7408f84d92b551d773671 [2018-12-08 14:35:55,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:35:55,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:35:55,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:35:55,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:35:55,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:35:55,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374725de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55, skipping insertion in model container [2018-12-08 14:35:55,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:35:55,196 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:35:55,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:35:55,292 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:35:55,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:35:55,313 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:35:55,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55 WrapperNode [2018-12-08 14:35:55,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:35:55,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:35:55,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:35:55,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:35:55,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:35:55,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:35:55,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:35:55,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:35:55,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... [2018-12-08 14:35:55,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:35:55,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:35:55,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:35:55,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:35:55,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db429a49-2663-4424-b563-ffe1cb887792/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:35:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:35:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:35:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:35:55,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:35:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:35:55,509 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:35:55,509 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 14:35:55,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:35:55 BoogieIcfgContainer [2018-12-08 14:35:55,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:35:55,510 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 14:35:55,510 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 14:35:55,512 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 14:35:55,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:35:55,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 02:35:55" (1/3) ... [2018-12-08 14:35:55,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a3a5324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:35:55, skipping insertion in model container [2018-12-08 14:35:55,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:35:55,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:35:55" (2/3) ... [2018-12-08 14:35:55,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a3a5324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:35:55, skipping insertion in model container [2018-12-08 14:35:55,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:35:55,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:35:55" (3/3) ... [2018-12-08 14:35:55,515 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-08 14:35:55,549 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:35:55,549 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 14:35:55,549 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 14:35:55,549 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 14:35:55,549 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:35:55,549 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:35:55,549 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 14:35:55,550 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:35:55,550 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 14:35:55,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 14:35:55,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 14:35:55,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:35:55,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:35:55,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 14:35:55,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:35:55,575 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 14:35:55,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-08 14:35:55,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-08 14:35:55,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:35:55,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:35:55,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 14:35:55,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:35:55,581 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2018-12-08 14:35:55,581 INFO L796 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2018-12-08 14:35:55,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 14:35:55,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-12-08 14:35:55,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:55,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:55,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-12-08 14:35:55,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:55,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:55,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:55,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:55,772 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:35:55,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:35:55,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:35:55,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:35:55,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:35:55,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:35:55,773 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:35:55,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:35:55,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2018-12-08 14:35:55,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:35:55,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:35:55,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:55,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:35:55,992 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:35:55,994 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-12-08 14:35:55,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:55,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:55,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:55,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:55,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:55,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:55,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:55,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:55,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:35:55,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,001 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-12-08 14:35:56,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,003 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-12-08 14:35:56,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:35:56,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,009 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-12-08 14:35:56,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,009 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:35:56,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,012 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:35:56,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,027 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-12-08 14:35:56,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:35:56,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:35:56,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,067 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:35:56,104 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 14:35:56,104 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 14:35:56,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:35:56,107 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:35:56,107 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:35:56,108 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~x~0.base)_1) = -1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_1 Supporting invariants [] [2018-12-08 14:35:56,120 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 14:35:56,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:35:56,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:35:56,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:35:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:35:56,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:35:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:35:56,176 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-12-08 14:35:56,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-12-08 14:35:56,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2018-12-08 14:35:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 14:35:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:35:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-12-08 14:35:56,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-08 14:35:56,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 14:35:56,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 14:35:56,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-12-08 14:35:56,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 14:35:56,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2018-12-08 14:35:56,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 14:35:56,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 14:35:56,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-12-08 14:35:56,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:35:56,214 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-08 14:35:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-12-08 14:35:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-08 14:35:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 14:35:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-08 14:35:56,229 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-08 14:35:56,229 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-08 14:35:56,229 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 14:35:56,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-12-08 14:35:56,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 14:35:56,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:35:56,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:35:56,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 14:35:56,230 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 14:35:56,230 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2018-12-08 14:35:56,230 INFO L796 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2018-12-08 14:35:56,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2018-12-08 14:35:56,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2018-12-08 14:35:56,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2018-12-08 14:35:56,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:35:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:35:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:35:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:35:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:35:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:35:56,335 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-08 14:35:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:35:56,354 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-12-08 14:35:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:35:56,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-12-08 14:35:56,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 14:35:56,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2018-12-08 14:35:56,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 14:35:56,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 14:35:56,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-12-08 14:35:56,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:35:56,357 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-08 14:35:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-12-08 14:35:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-08 14:35:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 14:35:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-08 14:35:56,357 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-08 14:35:56,358 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-08 14:35:56,358 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 14:35:56,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-12-08 14:35:56,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 14:35:56,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:35:56,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:35:56,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:35:56,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 14:35:56,358 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2018-12-08 14:35:56,359 INFO L796 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2018-12-08 14:35:56,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2018-12-08 14:35:56,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2018-12-08 14:35:56,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:35:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2018-12-08 14:35:56,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:35:56,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:35:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:35:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:35:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:35:56,534 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:35:56,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:35:56,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:35:56,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:35:56,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:35:56,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:35:56,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:35:56,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:35:56,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2018-12-08 14:35:56,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:35:56,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:35:56,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,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-12-08 14:35:56,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 14:35:56,731 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:35:56,732 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:35:56,732 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-12-08 14:35:56,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,734 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-12-08 14:35:56,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,737 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-12-08 14:35:56,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,739 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-12-08 14:35:56,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:35:56,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,742 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-12-08 14:35:56,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,744 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-12-08 14:35:56,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:35:56,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:35:56,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:35:56,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,748 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-12-08 14:35:56,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,748 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:35:56,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,749 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:35:56,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,755 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-12-08 14:35:56,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:35:56,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:35:56,762 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-12-08 14:35:56,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:35:56,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:35:56,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:35:56,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:35:56,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:35:56,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:35:56,780 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:35:56,801 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 14:35:56,801 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-08 14:35:56,801 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:35:56,802 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:35:56,802 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:35:56,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~x~0.base)_2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_2 - 1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-12-08 14:35:56,807 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 14:35:56,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:35:56,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:35:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:35:56,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:35:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:35:56,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:35:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:35:56,845 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-12-08 14:35:56,845 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-08 14:35:56,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2018-12-08 14:35:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 14:35:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:35:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-08 14:35:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-08 14:35:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-08 14:35:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-08 14:35:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:35:56,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-08 14:35:56,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:35:56,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-08 14:35:56,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:35:56,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:35:56,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:35:56,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:35:56,853 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:35:56,853 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:35:56,853 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:35:56,853 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 14:35:56,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:35:56,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:35:56,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 14:35:56,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 02:35:56 BoogieIcfgContainer [2018-12-08 14:35:56,858 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 14:35:56,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:35:56,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:35:56,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:35:56,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:35:55" (3/4) ... [2018-12-08 14:35:56,860 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 14:35:56,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:35:56,861 INFO L168 Benchmark]: Toolchain (without parser) took 1684.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 953.3 MB in the beginning and 855.6 MB in the end (delta: 97.7 MB). Peak memory consumption was 239.3 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,862 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:35:56,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.78 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,863 INFO L168 Benchmark]: Boogie Preprocessor took 44.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,864 INFO L168 Benchmark]: RCFGBuilder took 128.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,864 INFO L168 Benchmark]: BuchiAutomizer took 1347.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.6 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:35:56,864 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 855.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:35:56,866 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.05 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.78 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 128.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1347.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.6 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 855.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. 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 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 30 SDslu, 30 SDs, 0 SdLazy, 26 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf99 lsp91 ukn84 mio100 lsp65 div100 bol100 ite100 ukn100 eq165 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 2 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...