./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/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 64bit --witnessprinter.graph.data.programhash a80d10d797b477078e6dad6d87594a2a0aea1065 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:43:46,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:43:46,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:43:46,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:43:46,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:43:46,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:43:46,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:43:46,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:43:46,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:43:46,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:43:46,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:43:46,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:43:46,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:43:46,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:43:46,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:43:46,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:43:46,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:43:46,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:43:46,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:43:46,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:43:46,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:43:46,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:43:46,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:43:46,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:43:46,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:43:46,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:43:46,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:43:46,764 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:43:46,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:43:46,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:43:46,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:43:46,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:43:46,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:43:46,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:43:46,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:43:46,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:43:46,768 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:43:46,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:43:46,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:43:46,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:43:46,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:43:46,780 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:43:46,780 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:43:46,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:43:46,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:43:46,782 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:43:46,782 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:43:46,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:43:46,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:43:46,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:43:46,782 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:43:46,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:43:46,783 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:43:46,783 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:43:46,783 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:43:46,783 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_018bbc7b-fe0e-4eef-bebd-762306521b32/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a80d10d797b477078e6dad6d87594a2a0aea1065 [2018-11-23 03:43:46,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:43:46,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:43:46,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:43:46,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:43:46,815 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:43:46,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2018-11-23 03:43:46,849 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/data/620d1af69/c2d70e842d12490faa22ef3eb1fefe5f/FLAGb1e7d47d7 [2018-11-23 03:43:47,236 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:43:47,236 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/sv-benchmarks/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2018-11-23 03:43:47,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/data/620d1af69/c2d70e842d12490faa22ef3eb1fefe5f/FLAGb1e7d47d7 [2018-11-23 03:43:47,249 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/data/620d1af69/c2d70e842d12490faa22ef3eb1fefe5f [2018-11-23 03:43:47,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:43:47,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:43:47,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:43:47,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:43:47,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:43:47,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fae5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47, skipping insertion in model container [2018-11-23 03:43:47,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:43:47,275 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:43:47,378 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:43:47,380 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:43:47,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:43:47,396 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:43:47,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47 WrapperNode [2018-11-23 03:43:47,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:43:47,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:43:47,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:43:47,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:43:47,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:43:47,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:43:47,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:43:47,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:43:47,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... [2018-11-23 03:43:47,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:43:47,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:43:47,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:43:47,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:43:47,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/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-23 03:43:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:43:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:43:47,607 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:43:47,607 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 03:43:47,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:47 BoogieIcfgContainer [2018-11-23 03:43:47,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:43:47,609 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:43:47,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:43:47,612 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:43:47,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:43:47,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:43:47" (1/3) ... [2018-11-23 03:43:47,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5531f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:43:47, skipping insertion in model container [2018-11-23 03:43:47,614 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:43:47,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:47" (2/3) ... [2018-11-23 03:43:47,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5531f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:43:47, skipping insertion in model container [2018-11-23 03:43:47,614 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:43:47,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:47" (3/3) ... [2018-11-23 03:43:47,616 INFO L375 chiAutomizerObserver]: Analyzing ICFG Sunset_false-termination_true-no-overflow.c [2018-11-23 03:43:47,658 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:43:47,658 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:43:47,658 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:43:47,658 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:43:47,658 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:43:47,658 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:43:47,658 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:43:47,658 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:43:47,658 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:43:47,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-23 03:43:47,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:43:47,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:47,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:47,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:43:47,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:47,685 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:43:47,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-23 03:43:47,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:43:47,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:47,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:47,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 03:43:47,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:47,693 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L13-1true [2018-11-23 03:43:47,693 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(main_~i~0 > 10); 3#L10true assume 25 == main_~i~0;main_~i~0 := 30; 8#L10-2true assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 5#L13-1true [2018-11-23 03:43:47,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 03:43:47,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:47,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2018-11-23 03:43:47,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:47,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:47,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:47,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2018-11-23 03:43:47,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:47,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:47,846 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:47,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:47,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:47,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:47,847 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:47,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:47,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:47,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:47,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 03:43:47,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:47,848 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:47,865 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-23 03:43:47,877 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-23 03:43:47,880 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-23 03:43:47,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:47,936 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:47,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:47,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:47,959 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:47,959 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:47,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:47,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:47,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:47,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:47,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:47,981 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:48,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,007 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:48,020 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:48,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,020 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 03:43:48,020 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,022 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-23 03:43:48,024 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-23 03:43:48,026 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-23 03:43:48,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:48,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:48,094 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-23 03:43:48,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:48,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:48,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:48,104 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-23 03:43:48,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:48,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:48,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:48,114 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-23 03:43:48,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:48,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:48,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:48,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:48,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:48,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:48,128 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:48,128 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:48,128 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:48,129 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2018-11-23 03:43:48,130 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:48,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,195 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-23 03:43:48,204 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-23 03:43:48,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2018-11-23 03:43:48,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 6 states. [2018-11-23 03:43:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:43:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 03:43:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-23 03:43:48,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,252 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:48,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,286 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-23 03:43:48,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:48,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2018-11-23 03:43:48,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 8 states. [2018-11-23 03:43:48,310 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-23 03:43:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:43:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-23 03:43:48,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-23 03:43:48,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 03:43:48,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2018-11-23 03:43:48,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-11-23 03:43:48,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:43:48,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2018-11-23 03:43:48,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 03:43:48,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 03:43:48,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2018-11-23 03:43:48,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:48,320 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2018-11-23 03:43:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2018-11-23 03:43:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 03:43:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 03:43:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-23 03:43:48,340 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 03:43:48,340 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-23 03:43:48,340 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:43:48,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-23 03:43:48,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:43:48,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:48,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:48,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 03:43:48,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:48,342 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 127#L13-1 assume !!(main_~i~0 > 10); 130#L10 assume !(25 == main_~i~0); 123#L10-2 [2018-11-23 03:43:48,342 INFO L796 eck$LassoCheckResult]: Loop: 123#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 128#L13-1 assume !!(main_~i~0 > 10); 122#L10 assume 25 == main_~i~0;main_~i~0 := 30; 123#L10-2 [2018-11-23 03:43:48,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-23 03:43:48,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2018-11-23 03:43:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2018-11-23 03:43:48,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,378 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,379 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:48,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 03:43:48,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,380 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-23 03:43:48,382 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-23 03:43:48,383 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-23 03:43:48,419 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:48,419 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:48,423 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:48,439 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:48,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:48,456 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:48,462 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:48,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,485 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:48,499 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:48,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 03:43:48,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,501 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-23 03:43:48,510 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-23 03:43:48,516 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-23 03:43:48,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:48,551 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:48,551 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-23 03:43:48,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:48,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:48,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:48,557 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-23 03:43:48,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:48,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:48,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:48,565 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:48,568 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:48,569 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:48,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:48,569 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:48,569 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:48,570 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2018-11-23 03:43:48,570 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:48,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,594 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-23 03:43:48,595 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-23 03:43:48,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 03:43:48,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 34 transitions. Complement of second has 5 states. [2018-11-23 03:43:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 03:43:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 03:43:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:43:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 03:43:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2018-11-23 03:43:48,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:43:48,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2018-11-23 03:43:48,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 03:43:48,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 03:43:48,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2018-11-23 03:43:48,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:48,612 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2018-11-23 03:43:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2018-11-23 03:43:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-23 03:43:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 03:43:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2018-11-23 03:43:48,616 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2018-11-23 03:43:48,616 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2018-11-23 03:43:48,616 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:43:48,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2018-11-23 03:43:48,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:43:48,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:48,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:48,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:48,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:48,619 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 198#L13-1 assume !!(main_~i~0 > 10); 205#L10 assume 25 == main_~i~0;main_~i~0 := 30; 206#L10-2 assume !(main_~i~0 <= 30);main_~i~0 := 20; 199#L13-1 [2018-11-23 03:43:48,619 INFO L796 eck$LassoCheckResult]: Loop: 199#L13-1 assume !!(main_~i~0 > 10); 200#L10 assume 25 == main_~i~0;main_~i~0 := 30; 210#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 199#L13-1 [2018-11-23 03:43:48,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2018-11-23 03:43:48,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,641 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-23 03:43:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:48,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:43:48,645 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:43:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2018-11-23 03:43:48,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,661 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,661 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,661 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:48,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 03:43:48,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,663 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-23 03:43:48,667 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-23 03:43:48,682 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-23 03:43:48,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:48,704 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:48,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:48,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:48,730 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:48,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:48,750 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:48,763 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:48,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,764 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 03:43:48,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,764 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,765 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-23 03:43:48,767 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-23 03:43:48,770 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-23 03:43:48,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:48,809 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:48,810 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-23 03:43:48,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:48,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:48,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:48,814 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-23 03:43:48,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:48,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:48,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:48,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:48,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:48,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:48,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:48,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:48,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:48,820 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:48,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:48,820 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:48,820 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:48,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2018-11-23 03:43:48,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:48,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,853 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-23 03:43:48,853 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-23 03:43:48,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-23 03:43:48,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 66 transitions. Complement of second has 5 states. [2018-11-23 03:43:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:43:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 03:43:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,866 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:48,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:48,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:48,897 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-23 03:43:48,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:48,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-23 03:43:48,913 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 44 states and 70 transitions. Complement of second has 7 states. [2018-11-23 03:43:48,913 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-23 03:43:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:43:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 03:43:48,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 03:43:48,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:43:48,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 03:43:48,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:48,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2018-11-23 03:43:48,916 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 03:43:48,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2018-11-23 03:43:48,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 03:43:48,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 03:43:48,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2018-11-23 03:43:48,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:48,917 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2018-11-23 03:43:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2018-11-23 03:43:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 03:43:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 03:43:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2018-11-23 03:43:48,920 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2018-11-23 03:43:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:43:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:43:48,923 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2018-11-23 03:43:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:48,934 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-23 03:43:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:43:48,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2018-11-23 03:43:48,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 03:43:48,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-11-23 03:43:48,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 03:43:48,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 03:43:48,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-11-23 03:43:48,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:48,936 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-11-23 03:43:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-11-23 03:43:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-23 03:43:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 03:43:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-23 03:43:48,938 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-23 03:43:48,938 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-23 03:43:48,938 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:43:48,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-23 03:43:48,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 03:43:48,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:48,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:48,939 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2018-11-23 03:43:48,939 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:48,939 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 442#L13-1 assume !!(main_~i~0 > 10); 453#L10 assume !(25 == main_~i~0); 457#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 449#L13-1 assume !!(main_~i~0 > 10); 437#L10 assume !(25 == main_~i~0); 438#L10-2 [2018-11-23 03:43:48,939 INFO L796 eck$LassoCheckResult]: Loop: 438#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 443#L13-1 assume !!(main_~i~0 > 10); 444#L10 assume 25 == main_~i~0;main_~i~0 := 30; 438#L10-2 [2018-11-23 03:43:48,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2018-11-23 03:43:48,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2018-11-23 03:43:48,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2018-11-23 03:43:48,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:48,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:48,980 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:48,980 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:48,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:48,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:48,980 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:48,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:48,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:48,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:48,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 03:43:48,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:48,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:48,982 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-23 03:43:48,983 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-23 03:43:48,985 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-23 03:43:49,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,025 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,067 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:49,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,086 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:49,099 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:49,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 03:43:49,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,101 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-23 03:43:49,104 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-23 03:43:49,108 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-23 03:43:49,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:49,129 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-23 03:43:49,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,134 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-23 03:43:49,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:43:49,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:49,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:49,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:49,142 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:49,144 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:49,144 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:49,145 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:49,145 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:49,145 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:49,145 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2018-11-23 03:43:49,145 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:49,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,168 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-23 03:43:49,168 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-23 03:43:49,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2018-11-23 03:43:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:49,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:43:49,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,182 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:49,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,203 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-23 03:43:49,203 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:49,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2018-11-23 03:43:49,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:49,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:43:49,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:49,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,231 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-23 03:43:49,231 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:49,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 31 states and 47 transitions. Complement of second has 6 states. [2018-11-23 03:43:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-23 03:43:49,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 03:43:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 03:43:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 03:43:49,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. [2018-11-23 03:43:49,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 03:43:49,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2018-11-23 03:43:49,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:43:49,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 03:43:49,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-11-23 03:43:49,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:49,244 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-23 03:43:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-11-23 03:43:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2018-11-23 03:43:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 03:43:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-23 03:43:49,247 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 03:43:49,247 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 03:43:49,247 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:43:49,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-11-23 03:43:49,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 03:43:49,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:49,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:49,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:49,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:49,247 INFO L794 eck$LassoCheckResult]: Stem: 664#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 665#L13-1 assume !!(main_~i~0 > 10); 671#L10 assume !(25 == main_~i~0); 672#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2018-11-23 03:43:49,248 INFO L796 eck$LassoCheckResult]: Loop: 666#L13-1 assume !!(main_~i~0 > 10); 660#L10 assume !(25 == main_~i~0); 661#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2018-11-23 03:43:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2018-11-23 03:43:49,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2018-11-23 03:43:49,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2018-11-23 03:43:49,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,285 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,285 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:49,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 03:43:49,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,287 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-23 03:43:49,288 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-23 03:43:49,291 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-23 03:43:49,341 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,342 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,358 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,378 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,380 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:49,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,435 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:49,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:49,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 03:43:49,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,438 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-23 03:43:49,440 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-23 03:43:49,444 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-23 03:43:49,483 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,483 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:49,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:43:49,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,487 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-23 03:43:49,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:49,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,488 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:43:49,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:43:49,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:49,492 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:49,493 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:49,493 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:43:49,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:49,494 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:49,495 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:49,495 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:43:49,495 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:49,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,516 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-23 03:43:49,516 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-23 03:43:49,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 03:43:49,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-23 03:43:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:49,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 03:43:49,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:43:49,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 03:43:49,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2018-11-23 03:43:49,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 03:43:49,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2018-11-23 03:43:49,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 03:43:49,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:43:49,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2018-11-23 03:43:49,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:49,525 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-23 03:43:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2018-11-23 03:43:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 03:43:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:43:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-23 03:43:49,527 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-23 03:43:49,527 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-23 03:43:49,527 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:43:49,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2018-11-23 03:43:49,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 03:43:49,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:49,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:49,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-23 03:43:49,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 03:43:49,528 INFO L794 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 754#L13-1 assume !!(main_~i~0 > 10); 768#L10 assume !(25 == main_~i~0); 769#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 756#L13-1 assume !!(main_~i~0 > 10); 757#L10 assume 25 == main_~i~0;main_~i~0 := 30; 760#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2018-11-23 03:43:49,528 INFO L796 eck$LassoCheckResult]: Loop: 761#L13-1 assume !!(main_~i~0 > 10); 771#L10 assume !(25 == main_~i~0); 773#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2018-11-23 03:43:49,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2018-11-23 03:43:49,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2018-11-23 03:43:49,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2018-11-23 03:43:49,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,551 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,551 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:49,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 03:43:49,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,552 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-23 03:43:49,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:43:49,556 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-23 03:43:49,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,598 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,633 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,636 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:49,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,675 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:49,676 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:49,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 03:43:49,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,677 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,677 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-23 03:43:49,686 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-23 03:43:49,692 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-23 03:43:49,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:49,727 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-23 03:43:49,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,731 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-23 03:43:49,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,732 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:43:49,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:43:49,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:49,735 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:49,737 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:49,737 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:43:49,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:49,737 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:49,737 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:49,737 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:43:49,737 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:49,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,773 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-23 03:43:49,774 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-23 03:43:49,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-23 03:43:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:43:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:49,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,796 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-23 03:43:49,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:49,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-23 03:43:49,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:49,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:43:49,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,802 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:49,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,816 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-23 03:43:49,817 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:43:49,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 03:43:49,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 52 transitions. Complement of second has 4 states. [2018-11-23 03:43:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:43:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 03:43:49,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 03:43:49,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 03:43:49,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 03:43:49,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:49,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. [2018-11-23 03:43:49,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 03:43:49,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2018-11-23 03:43:49,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:43:49,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:43:49,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2018-11-23 03:43:49,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:49,826 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-11-23 03:43:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2018-11-23 03:43:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-11-23 03:43:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:43:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-11-23 03:43:49,828 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-23 03:43:49,828 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-23 03:43:49,828 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:43:49,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2018-11-23 03:43:49,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 03:43:49,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:49,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:49,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:49,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-23 03:43:49,829 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1007#L13-1 assume !!(main_~i~0 > 10); 1012#L10 assume !(25 == main_~i~0); 1013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2018-11-23 03:43:49,829 INFO L796 eck$LassoCheckResult]: Loop: 1008#L13-1 assume !!(main_~i~0 > 10); 1005#L10 assume !(25 == main_~i~0); 1004#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1011#L13-1 assume !!(main_~i~0 > 10); 1015#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1014#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2018-11-23 03:43:49,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2018-11-23 03:43:49,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2018-11-23 03:43:49,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2018-11-23 03:43:49,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:49,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,852 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:49,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 03:43:49,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,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-23 03:43:49,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-23 03:43:49,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-23 03:43:49,877 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,877 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:49,893 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:49,896 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:49,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:49,918 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:49,931 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:49,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:49,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:49,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:49,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:49,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:49,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:49,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:49,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 03:43:49,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:49,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:49,933 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-23 03:43:49,934 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-23 03:43:49,936 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-23 03:43:49,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:49,957 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:49,957 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-23 03:43:49,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,961 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-23 03:43:49,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:49,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:49,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:49,964 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-23 03:43:49,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:49,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:49,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:49,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:49,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:49,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:49,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:49,967 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:49,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:49,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:49,968 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:49,968 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:49,969 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:49,969 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2018-11-23 03:43:49,970 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:49,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:49,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,016 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-23 03:43:50,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 03:43:50,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 7 states. [2018-11-23 03:43:50,043 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-23 03:43:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 03:43:50,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 03:43:50,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,044 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 03:43:50,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 03:43:50,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 9 states. [2018-11-23 03:43:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 03:43:50,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 03:43:50,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 03:43:50,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:50,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2018-11-23 03:43:50,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 03:43:50,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2018-11-23 03:43:50,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:43:50,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:43:50,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2018-11-23 03:43:50,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:50,107 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-23 03:43:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2018-11-23 03:43:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-23 03:43:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 03:43:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-23 03:43:50,115 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 03:43:50,115 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-23 03:43:50,115 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:43:50,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-23 03:43:50,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 03:43:50,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:50,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:50,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2018-11-23 03:43:50,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-23 03:43:50,117 INFO L794 eck$LassoCheckResult]: Stem: 1226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1227#L13-1 assume !!(main_~i~0 > 10); 1234#L10 assume !(25 == main_~i~0); 1235#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1228#L13-1 assume !!(main_~i~0 > 10); 1230#L10 assume !(25 == main_~i~0); 1251#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1247#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2018-11-23 03:43:50,117 INFO L796 eck$LassoCheckResult]: Loop: 1237#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2018-11-23 03:43:50,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2018-11-23 03:43:50,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2018-11-23 03:43:50,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2018-11-23 03:43:50,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 03:43:50,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:43:50,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:43:50,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 03:43:50,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:43:50,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 03:43:50,225 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:50,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:50,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:50,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:50,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:50,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:50,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:50,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 03:43:50,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:50,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:50,226 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-23 03:43:50,230 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-23 03:43:50,234 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-23 03:43:50,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:50,259 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:50,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:50,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:50,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:50,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:50,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:43:50,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:50,313 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:50,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:50,345 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:50,359 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:50,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:50,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:50,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:50,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:50,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:50,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:50,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 03:43:50,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:50,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:50,360 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-23 03:43:50,362 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-23 03:43:50,365 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-23 03:43:50,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:50,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:50,383 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-23 03:43:50,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:50,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:50,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:50,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:50,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:50,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:50,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:50,386 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-23 03:43:50,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:50,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:50,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:50,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:50,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:50,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:50,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:50,388 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:50,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:50,389 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:50,389 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:50,390 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:50,390 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:50,390 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2018-11-23 03:43:50,390 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:50,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,443 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-23 03:43:50,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 03:43:50,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 81 states and 107 transitions. Complement of second has 7 states. [2018-11-23 03:43:50,460 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-23 03:43:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 03:43:50,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 03:43:50,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,461 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,490 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 03:43:50,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 03:43:50,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 9 states. [2018-11-23 03:43:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 03:43:50,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 03:43:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,510 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,553 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 03:43:50,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 03:43:50,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 101 states and 141 transitions. Complement of second has 10 states. [2018-11-23 03:43:50,571 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-23 03:43:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 03:43:50,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 03:43:50,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,572 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,608 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 03:43:50,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-23 03:43:50,630 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 76 states and 101 transitions. Complement of second has 11 states. [2018-11-23 03:43:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 03:43:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-23 03:43:50,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-23 03:43:50,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-23 03:43:50,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-23 03:43:50,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2018-11-23 03:43:50,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-23 03:43:50,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2018-11-23 03:43:50,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:43:50,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:43:50,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2018-11-23 03:43:50,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:50,634 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-23 03:43:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2018-11-23 03:43:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2018-11-23 03:43:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 03:43:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-23 03:43:50,638 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-23 03:43:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:43:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:43:50,638 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2018-11-23 03:43:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:50,651 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 03:43:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:43:50,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2018-11-23 03:43:50,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 03:43:50,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2018-11-23 03:43:50,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 03:43:50,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 03:43:50,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-23 03:43:50,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:50,653 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 03:43:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-23 03:43:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-23 03:43:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 03:43:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-23 03:43:50,654 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 03:43:50,654 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-23 03:43:50,654 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 03:43:50,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-23 03:43:50,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 03:43:50,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:50,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:50,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:50,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-23 03:43:50,655 INFO L794 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1993#L13-1 assume !!(main_~i~0 > 10); 2008#L10 assume !(25 == main_~i~0); 2010#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2018-11-23 03:43:50,655 INFO L796 eck$LassoCheckResult]: Loop: 1994#L13-1 assume !!(main_~i~0 > 10); 1988#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1989#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1996#L13-1 assume !!(main_~i~0 > 10); 1990#L10 assume !(25 == main_~i~0); 1991#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1997#L13-1 assume !!(main_~i~0 > 10); 2014#L10 assume !(25 == main_~i~0); 2013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2018-11-23 03:43:50,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2018-11-23 03:43:50,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2018-11-23 03:43:50,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,662 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2018-11-23 03:43:50,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:50,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:50,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:50,686 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:50,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:50,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:50,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:50,686 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:50,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:50,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:50,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-23 03:43:50,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:50,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:50,687 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-23 03:43:50,690 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-23 03:43:50,691 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-23 03:43:50,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:50,708 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:50,713 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:50,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:50,732 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:50,745 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:50,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:50,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:50,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:50,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:50,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:50,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:50,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:50,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-23 03:43:50,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:50,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:50,746 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-23 03:43:50,751 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-23 03:43:50,752 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-23 03:43:50,773 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:50,773 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:50,773 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-23 03:43:50,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:50,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:50,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:50,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:50,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:50,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:50,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:50,775 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:50,776 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:50,776 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:50,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:50,776 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:50,776 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:50,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2018-11-23 03:43:50,777 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:50,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,817 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 03:43:50,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 03:43:50,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 47 transitions. Complement of second has 5 states. [2018-11-23 03:43:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 03:43:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:50,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 03:43:50,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,825 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 03:43:50,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 03:43:50,868 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 40 states and 49 transitions. Complement of second has 7 states. [2018-11-23 03:43:50,868 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-23 03:43:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 03:43:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 03:43:50,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 03:43:50,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,869 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,907 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 03:43:50,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 03:43:50,913 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 49 transitions. Complement of second has 5 states. [2018-11-23 03:43:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 03:43:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 03:43:50,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 03:43:50,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,914 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:50,955 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 03:43:50,955 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 03:43:50,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-23 03:43:50,968 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-23 03:43:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 03:43:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 03:43:50,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 03:43:50,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:50,969 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:50,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:50,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,032 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 03:43:51,032 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 03:43:51,104 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. Result 210 states and 292 transitions. Complement of second has 48 states 9 powerset states39 rank states. The highest rank that occured is 5 [2018-11-23 03:43:51,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 03:43:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-23 03:43:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 03:43:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-23 03:43:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-23 03:43:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2018-11-23 03:43:51,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 03:43:51,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2018-11-23 03:43:51,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 03:43:51,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:43:51,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2018-11-23 03:43:51,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:51,123 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2018-11-23 03:43:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2018-11-23 03:43:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2018-11-23 03:43:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 03:43:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2018-11-23 03:43:51,129 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2018-11-23 03:43:51,129 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2018-11-23 03:43:51,129 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 03:43:51,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2018-11-23 03:43:51,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-23 03:43:51,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:51,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:51,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:51,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-23 03:43:51,133 INFO L794 eck$LassoCheckResult]: Stem: 2689#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 2691#L13-1 assume !!(main_~i~0 > 10); 2705#L10 assume !(25 == main_~i~0); 2701#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2018-11-23 03:43:51,133 INFO L796 eck$LassoCheckResult]: Loop: 2692#L13-1 assume !!(main_~i~0 > 10); 2693#L10 assume 25 == main_~i~0;main_~i~0 := 30; 2741#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2739#L13-1 assume !!(main_~i~0 > 10); 2734#L10 assume !(25 == main_~i~0); 2732#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2727#L13-1 assume !!(main_~i~0 > 10); 2714#L10 assume !(25 == main_~i~0); 2726#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2725#L13-1 assume !!(main_~i~0 > 10); 2698#L10 assume !(25 == main_~i~0); 2696#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2018-11-23 03:43:51,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2018-11-23 03:43:51,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:51,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2018-11-23 03:43:51,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2018-11-23 03:43:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,185 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:51,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:51,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:51,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:51,186 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:43:51,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:51,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:51,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:51,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2018-11-23 03:43:51,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:51,186 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:51,186 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-23 03:43:51,192 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-23 03:43:51,194 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-23 03:43:51,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:51,209 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:51,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:43:51,211 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:51,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:43:51,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:43:51,230 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:43:51,243 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:43:51,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:43:51,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:43:51,243 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:43:51,243 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:43:51,243 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:43:51,243 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:43:51,243 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:43:51,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2018-11-23 03:43:51,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:43:51,244 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:43:51,244 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-23 03:43:51,246 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-23 03:43:51,249 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-23 03:43:51,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:43:51,267 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:43:51,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-23 03:43:51,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:51,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:51,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:51,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:51,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:43:51,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:43:51,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:43:51,270 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-23 03:43:51,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:43:51,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:43:51,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:43:51,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:43:51,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:43:51,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:43:51,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:43:51,272 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:43:51,273 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 03:43:51,273 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 03:43:51,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:43:51,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 03:43:51,273 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:43:51,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2018-11-23 03:43:51,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 03:43:51,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 03:43:51,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-23 03:43:51,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2018-11-23 03:43:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:43:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-23 03:43:51,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:51,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,354 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:51,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 03:43:51,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-23 03:43:51,459 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 106 states and 135 transitions. Complement of second has 7 states. [2018-11-23 03:43:51,459 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-23 03:43:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:43:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 03:43:51,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:51,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,460 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:51,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,533 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 03:43:51,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-23 03:43:51,539 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 95 states and 126 transitions. Complement of second has 5 states. [2018-11-23 03:43:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:43:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-23 03:43:51,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:51,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,541 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:51,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,594 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 03:43:51,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-23 03:43:51,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 99 states and 128 transitions. Complement of second has 6 states. [2018-11-23 03:43:51,610 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-23 03:43:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:43:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 03:43:51,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:51,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:43:51,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:51,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:51,667 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 03:43:51,667 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-23 03:43:51,760 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. Result 1058 states and 1452 transitions. Complement of second has 131 states 20 powerset states111 rank states. The highest rank that occured is 5 [2018-11-23 03:43:51,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 03:43:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:43:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2018-11-23 03:43:51,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-23 03:43:51,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-23 03:43:51,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2018-11-23 03:43:51,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:43:51,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. [2018-11-23 03:43:51,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-23 03:43:51,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2018-11-23 03:43:51,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 03:43:51,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 03:43:51,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2018-11-23 03:43:51,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:43:51,771 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2018-11-23 03:43:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2018-11-23 03:43:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2018-11-23 03:43:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 03:43:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2018-11-23 03:43:51,780 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2018-11-23 03:43:51,780 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2018-11-23 03:43:51,780 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 03:43:51,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2018-11-23 03:43:51,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 03:43:51,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:43:51,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:43:51,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:43:51,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2018-11-23 03:43:51,785 INFO L794 eck$LassoCheckResult]: Stem: 4641#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 4645#L13-1 assume !!(main_~i~0 > 10); 4657#L10 assume !(25 == main_~i~0); 4655#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2018-11-23 03:43:51,785 INFO L796 eck$LassoCheckResult]: Loop: 4646#L13-1 assume !!(main_~i~0 > 10); 4647#L10 assume 25 == main_~i~0;main_~i~0 := 30; 4761#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4759#L13-1 assume !!(main_~i~0 > 10); 4757#L10 assume !(25 == main_~i~0); 4755#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4751#L13-1 assume !!(main_~i~0 > 10); 4748#L10 assume !(25 == main_~i~0); 4746#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4741#L13-1 assume !!(main_~i~0 > 10); 4660#L10 assume !(25 == main_~i~0); 4689#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4687#L13-1 assume !!(main_~i~0 > 10); 4652#L10 assume !(25 == main_~i~0); 4650#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2018-11-23 03:43:51,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2018-11-23 03:43:51,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2018-11-23 03:43:51,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2018-11-23 03:43:51,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:51,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:43:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 10); [?] assume 25 == main_~i~0;main_~i~0 := 30; [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- [2018-11-23 03:43:51,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:43:51 BoogieIcfgContainer [2018-11-23 03:43:51,875 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:43:51,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:43:51,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:43:51,875 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:43:51,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:47" (3/4) ... [2018-11-23 03:43:51,878 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 10); [?] assume 25 == main_~i~0;main_~i~0 := 30; [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- [2018-11-23 03:43:51,915 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_018bbc7b-fe0e-4eef-bebd-762306521b32/bin-2019/uautomizer/witness.graphml [2018-11-23 03:43:51,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:43:51,916 INFO L168 Benchmark]: Toolchain (without parser) took 4665.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -202.7 MB). Peak memory consumption was 146.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,917 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:43:51,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.63 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,918 INFO L168 Benchmark]: Boogie Preprocessor took 13.68 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:43:51,918 INFO L168 Benchmark]: RCFGBuilder took 172.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,919 INFO L168 Benchmark]: BuchiAutomizer took 4266.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -23.1 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,919 INFO L168 Benchmark]: Witness Printer took 40.57 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:51,921 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 24.63 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.68 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4266.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -23.1 MB). Peak memory consumption was 164.0 MB. Max. memory is 11.5 GB. * Witness Printer took 40.57 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (2 trivial, 5 deterministic, 5 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 27 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One deterministic module has affine ranking function -1 * i + 27 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 126 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 2.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 5. Minimization of det autom 0. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 200 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 126 states and ocurred in iteration 10. Nontrivial modules had stage [2, 3, 2, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/33 HoareTripleCheckerStatistics: 173 SDtfs, 246 SDslu, 6 SDs, 0 SdLazy, 346 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax234 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf113 smp97 tf112 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@129c5060=0, \result=0, i=25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 10); [?] assume 25 == main_~i~0;main_~i~0 := 30; [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := main_#t~nondet0; [L7] havoc main_#t~nondet0; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := #t~nondet0; [L7] havoc #t~nondet0; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 10); [?] assume 25 == main_~i~0;main_~i~0 := 30; [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 10); [?] assume !(25 == main_~i~0); [?] assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume 25 == main_~i~0; [L11] main_~i~0 := 30; [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] assume !!(main_~i~0 > 10); [L10-L12] assume !(25 == main_~i~0); [L13-L17] assume main_~i~0 <= 30; [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND TRUE 25 == main_~i~0 [L11] main_~i~0 := 30; [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(main_~i~0 > 10)) [L10] COND FALSE !(25 == main_~i~0) [L13] COND TRUE main_~i~0 <= 30 [L14] main_~i~0 := main_~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND TRUE 25 == ~i~0 [L11] ~i~0 := 30; [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9-L18] COND FALSE !(!(~i~0 > 10)) [L10] COND FALSE !(25 == ~i~0) [L13] COND TRUE ~i~0 <= 30 [L14] ~i~0 := ~i~0 - 1; [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 Loop: [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...