./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/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 63b671e779f88a024ade70e8e63a2c2a737aca60 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:08:29,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:08:29,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:08:29,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:08:29,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:08:29,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:08:29,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:08:29,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:08:29,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:08:29,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:08:29,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:08:29,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:08:29,426 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:08:29,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:08:29,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:08:29,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:08:29,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:08:29,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:08:29,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:08:29,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:08:29,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:08:29,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:08:29,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:08:29,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:08:29,435 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:08:29,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:08:29,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:08:29,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:08:29,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:08:29,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:08:29,438 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:08:29,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:08:29,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:08:29,439 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:08:29,439 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:08:29,440 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:08:29,440 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:08:29,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:08:29,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:08:29,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:08:29,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:08:29,450 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:08:29,450 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:08:29,450 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:08:29,450 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:08:29,450 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:08:29,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:08:29,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:08:29,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:08:29,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:08:29,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:08:29,453 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:08:29,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:08:29,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:08:29,453 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:08:29,454 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:08:29,454 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_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/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 -> 63b671e779f88a024ade70e8e63a2c2a737aca60 [2018-11-10 11:08:29,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:08:29,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:08:29,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:08:29,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:08:29,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:08:29,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-10 11:08:29,527 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/data/3b4f4ef79/f69e6df8af2e48f7b880de5b65d2a5d5/FLAGbe4d70947 [2018-11-10 11:08:29,837 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:08:29,837 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/sv-benchmarks/c/array-examples/sanfoundry_24_true-unreach-call_true-termination.i [2018-11-10 11:08:29,841 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/data/3b4f4ef79/f69e6df8af2e48f7b880de5b65d2a5d5/FLAGbe4d70947 [2018-11-10 11:08:29,852 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/data/3b4f4ef79/f69e6df8af2e48f7b880de5b65d2a5d5 [2018-11-10 11:08:29,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:08:29,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:08:29,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:08:29,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:08:29,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:08:29,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:08:29" (1/1) ... [2018-11-10 11:08:29,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1489e35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:29, skipping insertion in model container [2018-11-10 11:08:29,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:08:29" (1/1) ... [2018-11-10 11:08:29,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:08:29,889 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:08:29,997 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:08:29,999 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:08:30,011 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:08:30,023 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:08:30,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30 WrapperNode [2018-11-10 11:08:30,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:08:30,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:08:30,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:08:30,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:08:30,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:08:30,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:08:30,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:08:30,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:08:30,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... [2018-11-10 11:08:30,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:08:30,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:08:30,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:08:30,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:08:30,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/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-11-10 11:08:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:08:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:08:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:08:30,286 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:08:30,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:08:30 BoogieIcfgContainer [2018-11-10 11:08:30,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:08:30,287 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:08:30,287 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:08:30,290 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:08:30,291 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:08:30,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:08:29" (1/3) ... [2018-11-10 11:08:30,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39256fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:08:30, skipping insertion in model container [2018-11-10 11:08:30,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:08:30,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:08:30" (2/3) ... [2018-11-10 11:08:30,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39256fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:08:30, skipping insertion in model container [2018-11-10 11:08:30,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:08:30,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:08:30" (3/3) ... [2018-11-10 11:08:30,294 INFO L375 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24_true-unreach-call_true-termination.i [2018-11-10 11:08:30,336 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:08:30,338 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:08:30,338 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:08:30,338 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:08:30,338 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:08:30,338 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:08:30,338 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:08:30,338 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:08:30,338 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:08:30,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 11:08:30,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 11:08:30,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:30,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:30,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:08:30,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:30,368 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:08:30,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 11:08:30,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 11:08:30,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:30,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:30,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:08:30,370 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:30,375 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 25#L15-4true [2018-11-10 11:08:30,375 INFO L795 eck$LassoCheckResult]: Loop: 25#L15-4true assume true; 29#L15-1true assume !!(main_~i~0 < main_~num~0); 17#L17true SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 16#L17-1true assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 26#L15-3true main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 25#L15-4true [2018-11-10 11:08:30,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:08:30,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 34510472, now seen corresponding path program 1 times [2018-11-10 11:08:30,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:30,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949958, now seen corresponding path program 1 times [2018-11-10 11:08:30,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:30,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:30,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:30,698 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:08:30,699 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:08:30,699 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:08:30,699 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:08:30,699 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:08:30,699 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:08:30,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:08:30,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:08:30,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 11:08:30,700 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:08:30,700 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:08:30,719 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-10 11:08:30,723 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-10 11:08:30,725 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-10 11:08:30,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:08:30,740 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-10 11:08:30,745 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-10 11:08:30,748 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-10 11:08:30,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-10 11:08:30,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-10 11:08:30,856 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-10 11:08:30,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-10 11:08:31,046 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:08:31,049 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:08:31,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:08:31,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:31,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:31,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:31,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,055 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-10 11:08:31,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:31,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:31,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:31,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:08:31,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:31,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:31,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:31,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:08:31,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:31,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:31,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:31,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,063 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-10 11:08:31,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:31,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:31,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:31,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,066 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-10 11:08:31,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:31,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:31,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:31,075 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-10 11:08:31,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:31,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:31,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:31,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:31,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:31,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:31,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:08:31,154 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 11:08:31,154 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 11:08:31,156 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:08:31,158 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:08:31,158 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:08:31,159 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~num~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~num~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 11:08:31,184 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 11:08:31,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:31,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:31,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:31,232 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-10 11:08:31,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:08:31,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states. Second operand 4 states. [2018-11-10 11:08:31,302 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states.. Second operand 4 states. Result 68 states and 85 transitions. Complement of second has 8 states. [2018-11-10 11:08:31,303 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-11-10 11:08:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:08:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-10 11:08:31,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 11:08:31,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:31,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 11:08:31,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:31,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 11:08:31,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:31,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-11-10 11:08:31,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 11:08:31,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 26 states and 31 transitions. [2018-11-10 11:08:31,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 11:08:31,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 11:08:31,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-10 11:08:31,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:08:31,316 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 11:08:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-10 11:08:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 11:08:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 11:08:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-10 11:08:31,334 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 11:08:31,334 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 11:08:31,334 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:08:31,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-10 11:08:31,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 11:08:31,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:31,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:31,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:31,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:31,335 INFO L793 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 173#L15-4 assume true; 181#L15-1 assume !(main_~i~0 < main_~num~0); 175#L15-5 main_~i~0 := 0; 167#L22-4 [2018-11-10 11:08:31,335 INFO L795 eck$LassoCheckResult]: Loop: 167#L22-4 assume true; 168#L22-1 assume !!(main_~i~0 < main_~num~0); 176#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 183#L24-1 assume !((if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0);havoc main_#t~mem5; 166#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 167#L22-4 [2018-11-10 11:08:31,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 28694814, now seen corresponding path program 1 times [2018-11-10 11:08:31,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 66956842, now seen corresponding path program 1 times [2018-11-10 11:08:31,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1216610093, now seen corresponding path program 1 times [2018-11-10 11:08:31,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:31,412 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-10 11:08:31,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:08:31,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:08:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:08:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:08:31,463 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-10 11:08:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:08:31,506 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-10 11:08:31,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:08:31,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-11-10 11:08:31,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:08:31,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 38 transitions. [2018-11-10 11:08:31,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 11:08:31,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 11:08:31,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-11-10 11:08:31,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:08:31,509 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 11:08:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-11-10 11:08:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2018-11-10 11:08:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 11:08:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-10 11:08:31,511 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 11:08:31,511 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-10 11:08:31,511 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:08:31,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-11-10 11:08:31,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:08:31,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:31,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:31,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:31,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:31,513 INFO L793 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 249#L15-4 assume true; 256#L15-1 assume !!(main_~i~0 < main_~num~0); 240#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 237#L17-1 assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 238#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 257#L15-4 assume true; 258#L15-1 assume !(main_~i~0 < main_~num~0); 251#L15-5 main_~i~0 := 0; 246#L22-4 [2018-11-10 11:08:31,513 INFO L795 eck$LassoCheckResult]: Loop: 246#L22-4 assume true; 247#L22-1 assume !!(main_~i~0 < main_~num~0); 252#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 259#L24-1 assume !((if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0);havoc main_#t~mem5; 243#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 246#L22-4 [2018-11-10 11:08:31,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2000112133, now seen corresponding path program 1 times [2018-11-10 11:08:31,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash 66956842, now seen corresponding path program 2 times [2018-11-10 11:08:31,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1073325168, now seen corresponding path program 1 times [2018-11-10 11:08:31,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:08:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:08:31,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:08:31,710 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:08:31,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:31,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:31,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 11:08:31,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2018-11-10 11:08:31,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:08:31,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:08:31,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:08:31,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:6 [2018-11-10 11:08:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:08:31,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:08:31,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-10 11:08:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:08:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:08:31,851 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-10 11:08:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:08:31,934 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-11-10 11:08:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:08:31,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 85 transitions. [2018-11-10 11:08:31,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 11:08:31,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 85 transitions. [2018-11-10 11:08:31,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-10 11:08:31,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 11:08:31,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 85 transitions. [2018-11-10 11:08:31,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:08:31,937 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-11-10 11:08:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 85 transitions. [2018-11-10 11:08:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2018-11-10 11:08:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 11:08:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-10 11:08:31,940 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-10 11:08:31,940 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-10 11:08:31,940 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:08:31,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-10 11:08:31,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:08:31,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:31,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:31,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:31,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:31,942 INFO L793 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 412#L15-4 assume true; 418#L15-1 assume !!(main_~i~0 < main_~num~0); 402#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 399#L17-1 assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 400#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 419#L15-4 assume true; 421#L15-1 assume !(main_~i~0 < main_~num~0); 424#L15-5 main_~i~0 := 0; 428#L22-4 assume true; 427#L22-1 assume !!(main_~i~0 < main_~num~0); 426#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 422#L24-1 assume (if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0;havoc main_#t~mem5; 397#L26 [2018-11-10 11:08:31,942 INFO L795 eck$LassoCheckResult]: Loop: 397#L26 SUMMARY for call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L26 398#L26-1 assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if (if printOdd_~i < 0 && printOdd_~i % 2 != 0 then printOdd_~i % 2 - 2 else printOdd_~i % 2) != 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 410#L3-4 assume !(__VERIFIER_assert_~cond == 0); 403#L3-7 assume { :end_inline___VERIFIER_assert } true; 404#L7 assume { :end_inline_printOdd } true;havoc main_#t~mem6; 405#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 408#L22-4 assume true; 409#L22-1 assume !!(main_~i~0 < main_~num~0); 414#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 423#L24-1 assume (if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0;havoc main_#t~mem5; 397#L26 [2018-11-10 11:08:31,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -381018621, now seen corresponding path program 1 times [2018-11-10 11:08:31,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 828004624, now seen corresponding path program 1 times [2018-11-10 11:08:31,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:31,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:31,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2095078546, now seen corresponding path program 1 times [2018-11-10 11:08:31,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:08:32,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:08:32,059 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9db20e46-1cfa-4d2f-83c7-ab2435caae9c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:08:32,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:32,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:08:32,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:08:32,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 11:08:32,363 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2018-11-10 11:08:32,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:08:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:08:32,363 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-10 11:08:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:08:32,441 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-10 11:08:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:08:32,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 123 transitions. [2018-11-10 11:08:32,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:08:32,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 91 states and 101 transitions. [2018-11-10 11:08:32,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 11:08:32,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 11:08:32,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 101 transitions. [2018-11-10 11:08:32,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:08:32,444 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-10 11:08:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 101 transitions. [2018-11-10 11:08:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2018-11-10 11:08:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 11:08:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-10 11:08:32,447 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 11:08:32,447 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-10 11:08:32,447 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:08:32,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2018-11-10 11:08:32,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 11:08:32,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:32,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:32,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:32,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:32,449 INFO L793 eck$LassoCheckResult]: Stem: 663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 660#L15-4 assume true; 666#L15-1 assume !!(main_~i~0 < main_~num~0); 684#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 678#L17-1 assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 679#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 667#L15-4 assume true; 668#L15-1 assume !!(main_~i~0 < main_~num~0); 649#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 646#L17-1 assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 647#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 687#L15-4 assume true; 686#L15-1 assume !(main_~i~0 < main_~num~0); 685#L15-5 main_~i~0 := 0; 655#L22-4 assume true; 656#L22-1 assume !!(main_~i~0 < main_~num~0); 662#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 671#L24-1 assume (if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0;havoc main_#t~mem5; 644#L26 [2018-11-10 11:08:32,449 INFO L795 eck$LassoCheckResult]: Loop: 644#L26 SUMMARY for call main_#t~mem6 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L26 645#L26-1 assume { :begin_inline_printOdd } true;printOdd_#in~i := main_#t~mem6;havoc printOdd_~i;printOdd_~i := printOdd_#in~i;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if (if printOdd_~i < 0 && printOdd_~i % 2 != 0 then printOdd_~i % 2 - 2 else printOdd_~i % 2) != 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 658#L3-4 assume !(__VERIFIER_assert_~cond == 0); 650#L3-7 assume { :end_inline___VERIFIER_assert } true; 651#L7 assume { :end_inline_printOdd } true;havoc main_#t~mem6; 652#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 657#L22-4 assume true; 682#L22-1 assume !!(main_~i~0 < main_~num~0); 681#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 676#L24-1 assume (if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0;havoc main_#t~mem5; 644#L26 [2018-11-10 11:08:32,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 924150214, now seen corresponding path program 2 times [2018-11-10 11:08:32,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 828004624, now seen corresponding path program 2 times [2018-11-10 11:08:32,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:32,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:32,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:08:32,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1283583851, now seen corresponding path program 2 times [2018-11-10 11:08:32,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:08:32,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:32,695 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2018-11-10 11:08:32,801 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2018-11-10 11:08:32,907 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:08:32,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:08:32,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:08:32,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:08:32,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:08:32,908 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:08:32,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:08:32,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:08:32,908 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration5_Lasso [2018-11-10 11:08:32,908 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:08:32,908 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:08:32,911 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-10 11:08:32,912 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-10 11:08:32,913 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-10 11:08:32,914 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-10 11:08:32,915 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-10 11:08:32,916 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-10 11:08:32,917 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-10 11:08:32,918 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-10 11:08:32,919 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-10 11:08:32,920 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-10 11:08:32,922 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-10 11:08:32,923 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-10 11:08:33,250 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:08:33,250 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:08:33,251 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-10 11:08:33,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,253 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-10 11:08:33,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,255 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-10 11:08:33,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,256 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-10 11:08:33,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,258 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-10 11:08:33,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,261 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-10 11:08:33,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,263 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-10 11:08:33,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,265 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-10 11:08:33,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,267 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-10 11:08:33,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,268 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-10 11:08:33,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:33,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:33,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:33,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,271 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-10 11:08:33,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,274 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-10 11:08:33,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,277 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-10 11:08:33,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:08:33,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,285 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-10 11:08:33,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:33,289 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-10 11:08:33,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:33,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:33,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:33,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:33,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:33,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:33,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:08:33,319 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 11:08:33,319 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 11:08:33,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:08:33,320 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:08:33,321 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:08:33,321 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#array~0.offset, v_rep(select #length ULTIMATE.start_main_~#array~0.base)_2) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#array~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#array~0.base)_2 Supporting invariants [] [2018-11-10 11:08:33,348 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 11:08:33,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:08:33,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:33,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:33,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:33,409 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-10 11:08:33,409 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 11:08:33,409 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-10 11:08:33,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 59 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 70 states and 79 transitions. Complement of second has 6 states. [2018-11-10 11:08:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:08:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:08:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-10 11:08:33,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 19 letters. Loop has 10 letters. [2018-11-10 11:08:33,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:33,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 29 letters. Loop has 10 letters. [2018-11-10 11:08:33,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:33,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 19 letters. Loop has 20 letters. [2018-11-10 11:08:33,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:33,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 79 transitions. [2018-11-10 11:08:33,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:08:33,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 30 states and 32 transitions. [2018-11-10 11:08:33,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 11:08:33,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 11:08:33,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2018-11-10 11:08:33,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:08:33,436 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 11:08:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2018-11-10 11:08:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 11:08:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 11:08:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-10 11:08:33,438 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 11:08:33,438 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-10 11:08:33,438 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:08:33,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2018-11-10 11:08:33,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:08:33,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:08:33,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:08:33,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:08:33,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:08:33,439 INFO L793 eck$LassoCheckResult]: Stem: 908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem3, main_#t~post1, main_#t~mem5, main_#t~mem6, main_#t~post4, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~num~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;main_~num~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := 0; 903#L15-4 assume true; 909#L15-1 assume !!(main_~i~0 < main_~num~0); 896#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 894#L17-1 assume (if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0;havoc main_#t~mem2; 895#L19 SUMMARY for call main_#t~mem3 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L19 897#L19-1 assume { :begin_inline_printEven } true;printEven_#in~i := main_#t~mem3;havoc printEven_~i;printEven_~i := printEven_#in~i;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if (if printEven_~i < 0 && printEven_~i % 2 != 0 then printEven_~i % 2 - 2 else printEven_~i % 2) == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 898#L3 assume !(__VERIFIER_assert_~cond == 0); 906#L3-3 assume { :end_inline___VERIFIER_assert } true; 907#L4 assume { :end_inline_printEven } true;havoc main_#t~mem3; 912#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 910#L15-4 assume true; 911#L15-1 assume !!(main_~i~0 < main_~num~0); 920#L17 SUMMARY for call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L17 918#L17-1 assume !((if main_#t~mem2 < 0 && main_#t~mem2 % 2 != 0 then main_#t~mem2 % 2 - 2 else main_#t~mem2 % 2) == 0);havoc main_#t~mem2; 916#L15-3 main_#t~post1 := main_~i~0;main_~i~0 := main_#t~post1 + 1;havoc main_#t~post1; 915#L15-4 assume true; 914#L15-1 assume !(main_~i~0 < main_~num~0); 904#L15-5 main_~i~0 := 0; 899#L22-4 [2018-11-10 11:08:33,439 INFO L795 eck$LassoCheckResult]: Loop: 899#L22-4 assume true; 900#L22-1 assume !!(main_~i~0 < main_~num~0); 905#L24 SUMMARY for call main_#t~mem5 := read~int(main_~#array~0.base, main_~#array~0.offset + main_~i~0 * 4, 4); srcloc: L24 913#L24-1 assume !((if main_#t~mem5 < 0 && main_#t~mem5 % 2 != 0 then main_#t~mem5 % 2 - 2 else main_#t~mem5 % 2) != 0);havoc main_#t~mem5; 901#L22-3 main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 899#L22-4 [2018-11-10 11:08:33,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1773815242, now seen corresponding path program 1 times [2018-11-10 11:08:33,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:33,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:08:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:33,454 INFO L82 PathProgramCache]: Analyzing trace with hash 66956842, now seen corresponding path program 3 times [2018-11-10 11:08:33,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:33,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:33,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:08:33,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1276862975, now seen corresponding path program 1 times [2018-11-10 11:08:33,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:08:33,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:08:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:08:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:08:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:08:33,663 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2018-11-10 11:08:33,841 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 59 [2018-11-10 11:08:33,842 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:08:33,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:08:33,842 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:08:33,842 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:08:33,842 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:08:33,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:08:33,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:08:33,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:08:33,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-10 11:08:33,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:08:33,843 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:08:33,844 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-10 11:08:33,851 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-10 11:08:33,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-10 11:08:33,853 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-10 11:08:33,855 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-10 11:08:33,856 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-10 11:08:33,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-10 11:08:33,858 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-10 11:08:33,867 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-10 11:08:33,869 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-10 11:08:33,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-11-10 11:08:33,872 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-10 11:08:34,161 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:08:34,162 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:08:34,162 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-10 11:08:34,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,165 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-10 11:08:34,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,166 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-10 11:08:34,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,168 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-10 11:08:34,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:34,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:34,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,170 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-10 11:08:34,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,172 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-10 11:08:34,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,174 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-10 11:08:34,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,176 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-10 11:08:34,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:34,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:34,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,181 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-10 11:08:34,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:34,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:34,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,184 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-10 11:08:34,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,186 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-10 11:08:34,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:08:34,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:08:34,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:08:34,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:08:34,188 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-10 11:08:34,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:08:34,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:08:34,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:08:34,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:08:34,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:08:34,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:08:34,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:08:34,225 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 11:08:34,225 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 11:08:34,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:08:34,226 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:08:34,226 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:08:34,226 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#array~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#array~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 Supporting invariants [] [2018-11-10 11:08:34,250 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 11:08:34,252 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:08:34,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:08:34,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 11:08:34,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:08:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:34,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:08:34,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:08:34,318 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-10 11:08:34,318 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-10 11:08:34,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 11:08:34,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 32 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 35 states and 38 transitions. Complement of second has 7 states. [2018-11-10 11:08:34,347 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-10 11:08:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:08:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-10 11:08:34,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 11:08:34,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:34,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 11:08:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:34,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 11:08:34,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:08:34,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2018-11-10 11:08:34,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:08:34,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:08:34,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:08:34,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:08:34,349 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:08:34,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:08:34,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:08:34,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:08:34,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:08:34 BoogieIcfgContainer [2018-11-10 11:08:34,358 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:08:34,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:08:34,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:08:34,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:08:34,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:08:30" (3/4) ... [2018-11-10 11:08:34,362 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:08:34,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:08:34,363 INFO L168 Benchmark]: Toolchain (without parser) took 4508.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:08:34,364 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:08:34,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.88 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:08:34,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:08:34,365 INFO L168 Benchmark]: Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:08:34,365 INFO L168 Benchmark]: RCFGBuilder took 222.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:08:34,366 INFO L168 Benchmark]: BuchiAutomizer took 4071.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:08:34,366 INFO L168 Benchmark]: Witness Printer took 3.95 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-10 11:08:34,372 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.88 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 23.62 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4071.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 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.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function num + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * i + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * array + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 80 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 240 SDslu, 305 SDs, 0 SdLazy, 238 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax100 hnf100 lsp92 ukn98 mio100 lsp44 div184 bol100 ite100 ukn100 eq157 hnf63 smp93 dnf100 smp100 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...