./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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 be287e2bd97a0ee2eedfe145e117cb9cd9037f62 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:24:33,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:24:33,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:24:33,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:24:33,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:24:33,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:24:33,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:24:33,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:24:33,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:24:33,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:24:33,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:24:33,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:24:33,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:24:33,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:24:33,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:24:33,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:24:33,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:24:33,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:24:33,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:24:33,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:24:33,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:24:33,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:24:33,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:24:33,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:24:33,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:24:33,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:24:33,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:24:33,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:24:33,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:24:33,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:24:33,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:24:33,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:24:33,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:24:33,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:24:33,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:24:33,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:24:33,140 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:24:33,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:24:33,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:24:33,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:24:33,153 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:24:33,153 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:24:33,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:24:33,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:24:33,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:24:33,155 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:24:33,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:24:33,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:24:33,156 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:24:33,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:24:33,157 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_0ba152ae-9631-4c01-83d8-c3a249192829/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 -> be287e2bd97a0ee2eedfe145e117cb9cd9037f62 [2018-11-28 12:24:33,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:24:33,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:24:33,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:24:33,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:24:33,189 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:24:33,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-11-28 12:24:33,225 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/data/ef6313fa7/cc6949e7dece4266873e61eedc70341a/FLAG2eca751a1 [2018-11-28 12:24:33,621 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:24:33,622 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-11-28 12:24:33,627 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/data/ef6313fa7/cc6949e7dece4266873e61eedc70341a/FLAG2eca751a1 [2018-11-28 12:24:33,638 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/data/ef6313fa7/cc6949e7dece4266873e61eedc70341a [2018-11-28 12:24:33,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:24:33,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:24:33,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:24:33,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:24:33,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:24:33,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29cc7d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33, skipping insertion in model container [2018-11-28 12:24:33,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:24:33,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:24:33,768 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:24:33,770 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:24:33,780 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:24:33,789 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:24:33,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33 WrapperNode [2018-11-28 12:24:33,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:24:33,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:24:33,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:24:33,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:24:33,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:24:33,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:24:33,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:24:33,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:24:33,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... [2018-11-28 12:24:33,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:24:33,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:24:33,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:24:33,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:24:33,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2018-11-28 12:24:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2018-11-28 12:24:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:24:33,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:24:34,006 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:24:34,006 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:24:34,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:34 BoogieIcfgContainer [2018-11-28 12:24:34,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:24:34,007 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:24:34,007 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:24:34,009 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:24:34,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:24:34,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:24:33" (1/3) ... [2018-11-28 12:24:34,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717b2c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:24:34, skipping insertion in model container [2018-11-28 12:24:34,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:24:34,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:33" (2/3) ... [2018-11-28 12:24:34,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@717b2c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:24:34, skipping insertion in model container [2018-11-28 12:24:34,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:24:34,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:34" (3/3) ... [2018-11-28 12:24:34,012 INFO L375 chiAutomizerObserver]: Analyzing ICFG Parts_true-termination_true-no-overflow.c [2018-11-28 12:24:34,047 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:24:34,048 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:24:34,048 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:24:34,048 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:24:34,048 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:24:34,048 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:24:34,048 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:24:34,048 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:24:34,048 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:24:34,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-28 12:24:34,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:24:34,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:34,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:34,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:24:34,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:24:34,083 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:24:34,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-28 12:24:34,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:24:34,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:34,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:34,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:24:34,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:24:34,090 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6#L28true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L31true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8#L34-3true [2018-11-28 12:24:34,090 INFO L796 eck$LassoCheckResult]: Loop: 8#L34-3true assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10#L35-3true assume !true; 11#L34-2true main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8#L34-3true [2018-11-28 12:24:34,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2018-11-28 12:24:34,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 67975, now seen corresponding path program 1 times [2018-11-28 12:24:34,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:34,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:34,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:24:34,191 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:24:34,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:24:34,202 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-28 12:24:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:34,208 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2018-11-28 12:24:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:24:34,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-11-28 12:24:34,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:24:34,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-28 12:24:34,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 12:24:34,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 12:24:34,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-28 12:24:34,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:24:34,219 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 12:24:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-28 12:24:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 12:24:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 12:24:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-28 12:24:34,240 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 12:24:34,241 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 12:24:34,241 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:24:34,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-28 12:24:34,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:24:34,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:34,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:34,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:24:34,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:24:34,242 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 63#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 64#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 65#L34-3 [2018-11-28 12:24:34,243 INFO L796 eck$LassoCheckResult]: Loop: 65#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 66#L35-3 assume !(main_~q~0 <= main_~x~0); 67#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 65#L34-3 [2018-11-28 12:24:34,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 2 times [2018-11-28 12:24:34,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 67727, now seen corresponding path program 1 times [2018-11-28 12:24:34,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1484106392, now seen corresponding path program 1 times [2018-11-28 12:24:34,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:34,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:34,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:24:34,323 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:34,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:34,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:34,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:34,325 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:34,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:34,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:34,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:34,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:24:34,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:34,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:34,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:34,412 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:34,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:34,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:34,427 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:34,427 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:34,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:34,441 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:34,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:34,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:34,585 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:34,587 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:34,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:34,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:34,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:34,587 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:34,587 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:34,587 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:34,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:34,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 12:24:34,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:34,587 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:34,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:34,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:34,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:34,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:34,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:34,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:34,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:34,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:34,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:34,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:34,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:34,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:34,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:34,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:34,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:34,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:34,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:34,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:34,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:34,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:34,667 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:24:34,667 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:24:34,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:34,669 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:34,669 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:34,669 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2018-11-28 12:24:34,670 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:34,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:34,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:34,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:34,737 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-28 12:24:34,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 12:24:34,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 7 states. [2018-11-28 12:24:34,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:24:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-28 12:24:34,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 12:24:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:34,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 12:24:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:34,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 12:24:34,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:34,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-11-28 12:24:34,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:24:34,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-11-28 12:24:34,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 12:24:34,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 12:24:34,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-11-28 12:24:34,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:34,808 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-11-28 12:24:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-11-28 12:24:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-28 12:24:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 12:24:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-28 12:24:34,811 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-28 12:24:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:24:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:24:34,812 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2018-11-28 12:24:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:34,834 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-11-28 12:24:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:24:34,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-28 12:24:34,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-28 12:24:34,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2018-11-28 12:24:34,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 12:24:34,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 12:24:34,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-28 12:24:34,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:24:34,838 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 12:24:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-28 12:24:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 12:24:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 12:24:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 12:24:34,840 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 12:24:34,840 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 12:24:34,840 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:24:34,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 12:24:34,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-28 12:24:34,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:34,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:34,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:24:34,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:34,842 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 208#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 209#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 210#L34-3 [2018-11-28 12:24:34,842 INFO L796 eck$LassoCheckResult]: Loop: 210#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 211#L35-3 assume !!(main_~q~0 <= main_~x~0); 200#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 207#partsENTRY ~p := #in~p;~q := #in~q; 214#L20 assume ~p <= 0;#res := 1; 215#partsFINAL assume true; 199#partsEXIT >#67#return; 204#L36-1 havoc main_#t~ret8; 216#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 217#L35-3 assume !(main_~q~0 <= main_~x~0); 212#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 210#L34-3 [2018-11-28 12:24:34,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 3 times [2018-11-28 12:24:34,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 28034713, now seen corresponding path program 1 times [2018-11-28 12:24:34,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:34,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash 717639586, now seen corresponding path program 1 times [2018-11-28 12:24:34,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:34,959 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:34,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:34,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:34,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:34,959 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:34,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:34,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:34,960 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:34,960 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:24:34,960 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:34,960 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:34,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:34,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,012 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:35,012 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:35,020 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:35,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:35,063 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:35,065 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:35,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:35,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:35,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:35,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:35,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:35,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:35,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:35,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 12:24:35,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:35,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:35,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:35,158 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:35,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:35,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:35,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:35,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:35,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:35,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:35,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:35,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:35,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:35,167 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:35,167 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:24:35,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:35,168 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:35,168 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:35,168 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-11-28 12:24:35,168 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:35,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:35,263 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-28 12:24:35,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 12:24:35,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 142 states and 211 transitions. Complement of second has 28 states. [2018-11-28 12:24:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-28 12:24:35,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 11 letters. [2018-11-28 12:24:35,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:35,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 14 letters. Loop has 11 letters. [2018-11-28 12:24:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:35,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 22 letters. [2018-11-28 12:24:35,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:35,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 211 transitions. [2018-11-28 12:24:35,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-28 12:24:35,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 141 states and 210 transitions. [2018-11-28 12:24:35,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-28 12:24:35,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-28 12:24:35,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 210 transitions. [2018-11-28 12:24:35,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:35,448 INFO L705 BuchiCegarLoop]: Abstraction has 141 states and 210 transitions. [2018-11-28 12:24:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 210 transitions. [2018-11-28 12:24:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-28 12:24:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 12:24:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-11-28 12:24:35,460 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-11-28 12:24:35,461 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-11-28 12:24:35,461 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:24:35,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2018-11-28 12:24:35,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-28 12:24:35,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:35,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:35,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:24:35,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:35,464 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 483#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 484#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-11-28 12:24:35,464 INFO L796 eck$LassoCheckResult]: Loop: 486#L35-3 assume !!(main_~q~0 <= main_~x~0); 490#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 524#partsENTRY ~p := #in~p;~q := #in~q; 541#L20 assume !(~p <= 0); 527#L21 assume ~q <= 0;#res := 0; 525#partsFINAL assume true; 523#partsEXIT >#67#return; 522#L36-1 havoc main_#t~ret8; 521#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 520#L35-3 assume !(main_~q~0 <= main_~x~0); 494#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 485#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-11-28 12:24:35,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 1 times [2018-11-28 12:24:35,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:35,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 148862011, now seen corresponding path program 1 times [2018-11-28 12:24:35,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:35,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:35,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 12:24:35,535 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:24:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:24:35,535 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. cyclomatic complexity: 70 Second operand 9 states. [2018-11-28 12:24:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:35,674 INFO L93 Difference]: Finished difference Result 222 states and 381 transitions. [2018-11-28 12:24:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:24:35,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 381 transitions. [2018-11-28 12:24:35,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-11-28 12:24:35,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 375 transitions. [2018-11-28 12:24:35,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-28 12:24:35,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-28 12:24:35,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 375 transitions. [2018-11-28 12:24:35,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:35,688 INFO L705 BuchiCegarLoop]: Abstraction has 216 states and 375 transitions. [2018-11-28 12:24:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 375 transitions. [2018-11-28 12:24:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2018-11-28 12:24:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-28 12:24:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 289 transitions. [2018-11-28 12:24:35,708 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-11-28 12:24:35,709 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-11-28 12:24:35,709 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:24:35,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 289 transitions. [2018-11-28 12:24:35,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-28 12:24:35,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:35,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:35,712 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:24:35,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:35,713 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 842#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 843#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 844#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 846#L35-3 [2018-11-28 12:24:35,713 INFO L796 eck$LassoCheckResult]: Loop: 846#L35-3 assume !!(main_~q~0 <= main_~x~0); 850#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 902#partsENTRY ~p := #in~p;~q := #in~q; 936#L20 assume !(~p <= 0); 934#L21 assume ~q <= 0;#res := 0; 935#partsFINAL assume true; 954#partsEXIT >#67#return; 953#L36-1 havoc main_#t~ret8; 875#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 846#L35-3 [2018-11-28 12:24:35,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 2 times [2018-11-28 12:24:35,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:35,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1742875649, now seen corresponding path program 1 times [2018-11-28 12:24:35,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:35,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1841293844, now seen corresponding path program 1 times [2018-11-28 12:24:35,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:35,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:35,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:35,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:24:35,825 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:35,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:35,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:35,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:35,825 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:35,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:35,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:35,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:35,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 12:24:35,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:35,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:35,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:35,845 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:35,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:35,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:35,855 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:35,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:35,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:35,885 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0=1} Honda state: {ULTIMATE.start_main_~p~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:35,888 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:35,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:35,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:35,923 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:35,925 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:35,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:35,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:35,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:35,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:35,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:35,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:35,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:35,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 12:24:35,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:35,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:35,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:35,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:35,950 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:35,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:35,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:35,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:35,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:35,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:35,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:35,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:35,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:35,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:35,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:35,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:35,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:35,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:35,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:35,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:35,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:35,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:35,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:35,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:35,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:35,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:35,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:35,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:35,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:35,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:35,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:35,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:35,965 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:24:35,965 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:35,965 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:35,966 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:35,966 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:35,966 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = -2*ULTIMATE.start_main_~q~0 + 1 Supporting invariants [] [2018-11-28 12:24:35,966 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:35,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:35,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:36,026 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-28 12:24:36,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-11-28 12:24:36,135 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118. Second operand 7 states. Result 687 states and 1143 transitions. Complement of second has 25 states. [2018-11-28 12:24:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-28 12:24:36,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 12:24:36,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-28 12:24:36,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-28 12:24:36,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 1143 transitions. [2018-11-28 12:24:36,147 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2018-11-28 12:24:36,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 631 states and 1044 transitions. [2018-11-28 12:24:36,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-28 12:24:36,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-11-28 12:24:36,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 1044 transitions. [2018-11-28 12:24:36,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:36,176 INFO L705 BuchiCegarLoop]: Abstraction has 631 states and 1044 transitions. [2018-11-28 12:24:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 1044 transitions. [2018-11-28 12:24:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 592. [2018-11-28 12:24:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-28 12:24:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 977 transitions. [2018-11-28 12:24:36,209 INFO L728 BuchiCegarLoop]: Abstraction has 592 states and 977 transitions. [2018-11-28 12:24:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:24:36,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:24:36,210 INFO L87 Difference]: Start difference. First operand 592 states and 977 transitions. Second operand 5 states. [2018-11-28 12:24:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:36,302 INFO L93 Difference]: Finished difference Result 630 states and 1090 transitions. [2018-11-28 12:24:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:24:36,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1090 transitions. [2018-11-28 12:24:36,307 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-28 12:24:36,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 299 states and 504 transitions. [2018-11-28 12:24:36,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-28 12:24:36,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-28 12:24:36,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 504 transitions. [2018-11-28 12:24:36,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:36,312 INFO L705 BuchiCegarLoop]: Abstraction has 299 states and 504 transitions. [2018-11-28 12:24:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 504 transitions. [2018-11-28 12:24:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2018-11-28 12:24:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-28 12:24:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 399 transitions. [2018-11-28 12:24:36,322 INFO L728 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-11-28 12:24:36,322 INFO L608 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-11-28 12:24:36,322 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:24:36,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 399 transitions. [2018-11-28 12:24:36,323 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-28 12:24:36,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:36,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:36,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:36,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:36,324 INFO L794 eck$LassoCheckResult]: Stem: 3054#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3041#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3042#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3043#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3045#L35-3 assume !!(main_~q~0 <= main_~x~0); 3072#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3087#partsENTRY ~p := #in~p;~q := #in~q; 3239#L20 assume ~p <= 0;#res := 1; 3237#partsFINAL assume true; 3238#partsEXIT >#67#return; 3079#L36-1 [2018-11-28 12:24:36,324 INFO L796 eck$LassoCheckResult]: Loop: 3079#L36-1 havoc main_#t~ret8; 3064#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 3048#L35-3 assume !!(main_~q~0 <= main_~x~0); 3037#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3240#partsENTRY ~p := #in~p;~q := #in~q; 3241#L20 assume ~p <= 0;#res := 1; 3251#partsFINAL assume true; 3231#partsEXIT >#67#return; 3079#L36-1 [2018-11-28 12:24:36,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2114025366, now seen corresponding path program 1 times [2018-11-28 12:24:36,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:36,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:36,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:36,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 1 times [2018-11-28 12:24:36,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1106999392, now seen corresponding path program 1 times [2018-11-28 12:24:36,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:36,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,406 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:36,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:36,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:36,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:36,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:36,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:36,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:36,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:36,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 12:24:36,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:36,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:36,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,432 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:36,433 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:36,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:36,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:36,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:36,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:36,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:36,457 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:36,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:36,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:36,705 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:36,707 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:36,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:36,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:36,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:36,707 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:36,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:36,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:36,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:36,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 12:24:36,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:36,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:36,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:36,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:36,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:36,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:36,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:36,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:36,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:36,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:36,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:36,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:36,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:36,743 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:36,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:36,743 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:36,743 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:36,744 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~q~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 12:24:36,744 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:36,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:36,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:36,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:36,805 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:36,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152 Second operand 7 states. [2018-11-28 12:24:36,888 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152. Second operand 7 states. Result 370 states and 564 transitions. Complement of second has 13 states. [2018-11-28 12:24:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-28 12:24:36,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 12:24:36,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-28 12:24:36,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 16 letters. [2018-11-28 12:24:36,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:36,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 564 transitions. [2018-11-28 12:24:36,894 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-11-28 12:24:36,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 306 states and 470 transitions. [2018-11-28 12:24:36,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-28 12:24:36,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2018-11-28 12:24:36,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 470 transitions. [2018-11-28 12:24:36,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:36,898 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 470 transitions. [2018-11-28 12:24:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 470 transitions. [2018-11-28 12:24:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-28 12:24:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-28 12:24:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 467 transitions. [2018-11-28 12:24:36,905 INFO L728 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-11-28 12:24:36,905 INFO L608 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-11-28 12:24:36,905 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:24:36,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 467 transitions. [2018-11-28 12:24:36,907 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-11-28 12:24:36,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:36,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:36,907 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:36,907 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:24:36,908 INFO L794 eck$LassoCheckResult]: Stem: 3753#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3739#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3740#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3741#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3743#L35-3 assume !!(main_~q~0 <= main_~x~0); 3799#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3800#partsENTRY ~p := #in~p;~q := #in~q; 3884#L20 assume !(~p <= 0); 3885#L21 assume !(~q <= 0); 3981#L22 assume ~q > ~p; 3765#L22-1 call #t~ret0 := parts(~p, ~p);< 3974#partsENTRY [2018-11-28 12:24:36,908 INFO L796 eck$LassoCheckResult]: Loop: 3974#partsENTRY ~p := #in~p;~q := #in~q; 3976#L20 assume !(~p <= 0); 3977#L21 assume !(~q <= 0); 3982#L22 assume !(~q > ~p); 3763#L23 call #t~ret1 := parts(~p - ~q, ~q);< 3974#partsENTRY [2018-11-28 12:24:36,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1110295411, now seen corresponding path program 1 times [2018-11-28 12:24:36,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:36,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:36,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:36,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:36,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:36,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:24:36,924 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:36,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 1 times [2018-11-28 12:24:36,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:36,977 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:36,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:36,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:36,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:36,978 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:36,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:36,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:36,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:36,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 12:24:36,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:36,978 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:36,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:36,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:37,026 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:37,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:37,029 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:37,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:37,031 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:37,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:37,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:37,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:37,057 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:37,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:37,083 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:37,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:37,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:37,137 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:37,138 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:37,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:37,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:37,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:37,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:37,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:37,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:37,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:37,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 12:24:37,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:37,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:37,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:37,178 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:37,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:37,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:37,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:37,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:37,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:37,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:37,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:37,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:37,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:37,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:37,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:37,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:37,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:37,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:37,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:37,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:37,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:37,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:37,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:37,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:37,183 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:37,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:37,183 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:37,183 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:37,184 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-11-28 12:24:37,184 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:37,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:37,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:37,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:37,227 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-28 12:24:37,227 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172 Second operand 5 states. [2018-11-28 12:24:37,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172. Second operand 5 states. Result 904 states and 1531 transitions. Complement of second has 25 states. [2018-11-28 12:24:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:24:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-28 12:24:37,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 12:24:37,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:37,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 12:24:37,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:37,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 12:24:37,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:37,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1531 transitions. [2018-11-28 12:24:37,327 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 116 [2018-11-28 12:24:37,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 756 states and 1370 transitions. [2018-11-28 12:24:37,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2018-11-28 12:24:37,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2018-11-28 12:24:37,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 756 states and 1370 transitions. [2018-11-28 12:24:37,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:37,339 INFO L705 BuchiCegarLoop]: Abstraction has 756 states and 1370 transitions. [2018-11-28 12:24:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states and 1370 transitions. [2018-11-28 12:24:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 726. [2018-11-28 12:24:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-28 12:24:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1305 transitions. [2018-11-28 12:24:37,362 INFO L728 BuchiCegarLoop]: Abstraction has 726 states and 1305 transitions. [2018-11-28 12:24:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:24:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:24:37,363 INFO L87 Difference]: Start difference. First operand 726 states and 1305 transitions. Second operand 5 states. [2018-11-28 12:24:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:37,404 INFO L93 Difference]: Finished difference Result 731 states and 1299 transitions. [2018-11-28 12:24:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:24:37,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 1299 transitions. [2018-11-28 12:24:37,413 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 89 [2018-11-28 12:24:37,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 728 states and 1296 transitions. [2018-11-28 12:24:37,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-11-28 12:24:37,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-11-28 12:24:37,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 1296 transitions. [2018-11-28 12:24:37,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:37,423 INFO L705 BuchiCegarLoop]: Abstraction has 728 states and 1296 transitions. [2018-11-28 12:24:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 1296 transitions. [2018-11-28 12:24:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 687. [2018-11-28 12:24:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-28 12:24:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1228 transitions. [2018-11-28 12:24:37,443 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-11-28 12:24:37,443 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-11-28 12:24:37,443 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:24:37,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 1228 transitions. [2018-11-28 12:24:37,448 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-11-28 12:24:37,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:37,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:37,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:37,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:37,449 INFO L794 eck$LassoCheckResult]: Stem: 6524#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6511#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 6512#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 6517#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6819#L35-3 assume !!(main_~q~0 <= main_~x~0); 7026#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 7027#partsENTRY ~p := #in~p;~q := #in~q; 7046#L20 assume ~p <= 0;#res := 1; 7045#partsFINAL assume true; 7044#partsEXIT >#67#return; 7037#L36-1 havoc main_#t~ret8; 6810#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6808#L35-3 assume !(main_~q~0 <= main_~x~0); 6807#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6806#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-11-28 12:24:37,449 INFO L796 eck$LassoCheckResult]: Loop: 6514#L35-3 assume !!(main_~q~0 <= main_~x~0); 6812#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6815#partsENTRY ~p := #in~p;~q := #in~q; 6817#L20 assume !(~p <= 0); 6818#L21 assume ~q <= 0;#res := 0; 7063#partsFINAL assume true; 7060#partsEXIT >#67#return; 7051#L36-1 havoc main_#t~ret8; 6709#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6603#L35-3 assume !!(main_~q~0 <= main_~x~0); 6594#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6668#partsENTRY ~p := #in~p;~q := #in~q; 6665#L20 assume !(~p <= 0); 6661#L21 assume !(~q <= 0); 6659#L22 assume !(~q > ~p); 6613#L23 call #t~ret1 := parts(~p - ~q, ~q);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume ~p <= 0;#res := 1; 6703#partsFINAL assume true; 6748#partsEXIT >#63#return; 6616#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume !(~p <= 0); 6698#L21 assume ~q <= 0;#res := 0; 6699#partsFINAL assume true; 6710#partsEXIT >#65#return; 6682#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 6601#partsFINAL assume true; 6602#partsEXIT >#67#return; 6677#L36-1 havoc main_#t~ret8; 6676#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6593#L35-3 assume !(main_~q~0 <= main_~x~0); 6522#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6513#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-11-28 12:24:37,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash 771990724, now seen corresponding path program 2 times [2018-11-28 12:24:37,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:37,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:37,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:37,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:37,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:24:37,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:24:37,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:37,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:37,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:37,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 12:24:37,616 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:37,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 1 times [2018-11-28 12:24:37,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:37,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:24:37,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:37,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:37,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:37,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:24:37,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-28 12:24:37,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:24:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:24:37,830 INFO L87 Difference]: Start difference. First operand 687 states and 1228 transitions. cyclomatic complexity: 561 Second operand 11 states. [2018-11-28 12:24:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:37,899 INFO L93 Difference]: Finished difference Result 765 states and 1349 transitions. [2018-11-28 12:24:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:24:37,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 765 states and 1349 transitions. [2018-11-28 12:24:37,909 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 101 [2018-11-28 12:24:37,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 765 states to 759 states and 1342 transitions. [2018-11-28 12:24:37,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2018-11-28 12:24:37,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2018-11-28 12:24:37,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 759 states and 1342 transitions. [2018-11-28 12:24:37,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:37,927 INFO L705 BuchiCegarLoop]: Abstraction has 759 states and 1342 transitions. [2018-11-28 12:24:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states and 1342 transitions. [2018-11-28 12:24:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 686. [2018-11-28 12:24:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-28 12:24:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1226 transitions. [2018-11-28 12:24:37,954 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-11-28 12:24:37,954 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-11-28 12:24:37,954 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:24:37,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1226 transitions. [2018-11-28 12:24:37,960 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-11-28 12:24:37,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:37,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:37,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:37,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:37,963 INFO L794 eck$LassoCheckResult]: Stem: 8137#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8130#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 8131#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8132#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8419#L35-3 assume !!(main_~q~0 <= main_~x~0); 8124#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8194#partsENTRY ~p := #in~p;~q := #in~q; 8695#L20 assume ~p <= 0;#res := 1; 8694#partsFINAL assume true; 8123#partsEXIT >#67#return; 8125#L36-1 havoc main_#t~ret8; 8180#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8459#L35-3 assume !!(main_~q~0 <= main_~x~0); 8150#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8452#partsENTRY ~p := #in~p;~q := #in~q; 8456#L20 assume ~p <= 0;#res := 1; 8455#partsFINAL assume true; 8449#partsEXIT >#67#return; 8450#L36-1 havoc main_#t~ret8; 8637#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8403#L35-3 assume !(main_~q~0 <= main_~x~0); 8402#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8399#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-11-28 12:24:37,963 INFO L796 eck$LassoCheckResult]: Loop: 8396#L35-3 assume !!(main_~q~0 <= main_~x~0); 8393#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8394#partsENTRY ~p := #in~p;~q := #in~q; 8397#L20 assume !(~p <= 0); 8398#L21 assume ~q <= 0;#res := 0; 8448#partsFINAL assume true; 8446#partsEXIT >#67#return; 8441#L36-1 havoc main_#t~ret8; 8384#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8382#L35-3 assume !!(main_~q~0 <= main_~x~0); 8201#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8273#partsENTRY ~p := #in~p;~q := #in~q; 8271#L20 assume !(~p <= 0); 8269#L21 assume !(~q <= 0); 8268#L22 assume !(~q > ~p); 8232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume ~p <= 0;#res := 1; 8286#partsFINAL assume true; 8302#partsEXIT >#63#return; 8223#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume !(~p <= 0); 8281#L21 assume ~q <= 0;#res := 0; 8282#partsFINAL assume true; 8372#partsEXIT >#65#return; 8212#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 8213#partsFINAL assume true; 8207#partsEXIT >#67#return; 8204#L36-1 havoc main_#t~ret8; 8205#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8199#L35-3 assume !(main_~q~0 <= main_~x~0); 8200#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8401#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-11-28 12:24:37,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:37,963 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 3 times [2018-11-28 12:24:37,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:37,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:37,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 2 times [2018-11-28 12:24:37,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:37,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:24:38,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:38,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:24:38,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:24:38,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:38,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 12:24:38,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:38,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-28 12:24:38,174 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 12:24:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-28 12:24:38,174 INFO L87 Difference]: Start difference. First operand 686 states and 1226 transitions. cyclomatic complexity: 560 Second operand 18 states. [2018-11-28 12:24:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:38,570 INFO L93 Difference]: Finished difference Result 1128 states and 2454 transitions. [2018-11-28 12:24:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 12:24:38,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1128 states and 2454 transitions. [2018-11-28 12:24:38,580 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 197 [2018-11-28 12:24:38,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1128 states to 1078 states and 2389 transitions. [2018-11-28 12:24:38,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2018-11-28 12:24:38,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 601 [2018-11-28 12:24:38,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1078 states and 2389 transitions. [2018-11-28 12:24:38,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:38,591 INFO L705 BuchiCegarLoop]: Abstraction has 1078 states and 2389 transitions. [2018-11-28 12:24:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 2389 transitions. [2018-11-28 12:24:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 724. [2018-11-28 12:24:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 12:24:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1345 transitions. [2018-11-28 12:24:38,613 INFO L728 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-11-28 12:24:38,613 INFO L608 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-11-28 12:24:38,613 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:24:38,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 724 states and 1345 transitions. [2018-11-28 12:24:38,617 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 95 [2018-11-28 12:24:38,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:38,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:38,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:38,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 12:24:38,618 INFO L794 eck$LassoCheckResult]: Stem: 10100#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 10093#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 10094#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 10095#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10097#L35-3 assume !!(main_~q~0 <= main_~x~0); 10415#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10417#partsENTRY ~p := #in~p;~q := #in~q; 10420#L20 assume ~p <= 0;#res := 1; 10418#partsFINAL assume true; 10414#partsEXIT >#67#return; 10413#L36-1 havoc main_#t~ret8; 10412#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10410#L35-3 assume !!(main_~q~0 <= main_~x~0); 10403#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10406#partsENTRY ~p := #in~p;~q := #in~q; 10411#L20 assume ~p <= 0;#res := 1; 10409#partsFINAL assume true; 10402#partsEXIT >#67#return; 10404#L36-1 havoc main_#t~ret8; 10612#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10378#L35-3 assume !(main_~q~0 <= main_~x~0); 10377#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10374#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10371#L35-3 [2018-11-28 12:24:38,618 INFO L796 eck$LassoCheckResult]: Loop: 10371#L35-3 assume !!(main_~q~0 <= main_~x~0); 10368#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10369#partsENTRY ~p := #in~p;~q := #in~q; 10375#L20 assume !(~p <= 0); 10372#L21 assume ~q <= 0;#res := 0; 10370#partsFINAL assume true; 10367#partsEXIT >#67#return; 10365#L36-1 havoc main_#t~ret8; 10363#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10354#L35-3 assume !!(main_~q~0 <= main_~x~0); 10082#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10186#partsENTRY ~p := #in~p;~q := #in~q; 10258#L20 assume !(~p <= 0); 10254#L21 assume !(~q <= 0); 10251#L22 assume !(~q > ~p); 10205#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume ~p <= 0;#res := 1; 10276#partsFINAL assume true; 10299#partsEXIT >#63#return; 10199#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume !(~p <= 0); 10269#L21 assume ~q <= 0;#res := 0; 10270#partsFINAL assume true; 10314#partsEXIT >#65#return; 10317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 10187#partsFINAL assume true; 10188#partsEXIT >#67#return; 10330#L36-1 havoc main_#t~ret8; 10333#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10326#L35-3 assume !!(main_~q~0 <= main_~x~0); 10081#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10186#partsENTRY ~p := #in~p;~q := #in~q; 10258#L20 assume !(~p <= 0); 10254#L21 assume !(~q <= 0); 10251#L22 assume !(~q > ~p); 10205#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume ~p <= 0;#res := 1; 10276#partsFINAL assume true; 10299#partsEXIT >#63#return; 10199#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10230#partsENTRY ~p := #in~p;~q := #in~q; 10275#L20 assume !(~p <= 0); 10269#L21 assume ~q <= 0;#res := 0; 10270#partsFINAL assume true; 10314#partsEXIT >#65#return; 10317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 10187#partsFINAL assume true; 10188#partsEXIT >#67#return; 10328#L36-1 havoc main_#t~ret8; 10176#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10177#L35-3 assume !(main_~q~0 <= main_~x~0); 10327#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10373#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10371#L35-3 [2018-11-28 12:24:38,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 4 times [2018-11-28 12:24:38,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:38,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash -400961993, now seen corresponding path program 3 times [2018-11-28 12:24:38,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:38,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:38,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-28 12:24:38,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:38,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:38,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:24:38,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 12:24:38,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:38,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 12:24:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-28 12:24:38,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:38,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:24:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:24:38,857 INFO L87 Difference]: Start difference. First operand 724 states and 1345 transitions. cyclomatic complexity: 641 Second operand 17 states. [2018-11-28 12:24:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:39,254 INFO L93 Difference]: Finished difference Result 1220 states and 2142 transitions. [2018-11-28 12:24:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:24:39,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 2142 transitions. [2018-11-28 12:24:39,267 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 154 [2018-11-28 12:24:39,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1187 states and 2088 transitions. [2018-11-28 12:24:39,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 592 [2018-11-28 12:24:39,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 592 [2018-11-28 12:24:39,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1187 states and 2088 transitions. [2018-11-28 12:24:39,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:39,281 INFO L705 BuchiCegarLoop]: Abstraction has 1187 states and 2088 transitions. [2018-11-28 12:24:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states and 2088 transitions. [2018-11-28 12:24:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2018-11-28 12:24:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-11-28 12:24:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1822 transitions. [2018-11-28 12:24:39,315 INFO L728 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-11-28 12:24:39,315 INFO L608 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-11-28 12:24:39,315 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:24:39,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1012 states and 1822 transitions. [2018-11-28 12:24:39,321 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 106 [2018-11-28 12:24:39,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:39,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:39,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:39,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2018-11-28 12:24:39,323 INFO L794 eck$LassoCheckResult]: Stem: 12260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 12253#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 12254#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 12255#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12257#L35-3 assume !!(main_~q~0 <= main_~x~0); 12263#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12997#partsENTRY ~p := #in~p;~q := #in~q; 13003#L20 assume ~p <= 0;#res := 1; 12998#partsFINAL assume true; 12995#partsEXIT >#67#return; 12994#L36-1 havoc main_#t~ret8; 12993#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12991#L35-3 assume !!(main_~q~0 <= main_~x~0); 12987#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12988#partsENTRY ~p := #in~p;~q := #in~q; 12992#L20 assume ~p <= 0;#res := 1; 12990#partsFINAL assume true; 12986#partsEXIT >#67#return; 12985#L36-1 havoc main_#t~ret8; 12619#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12616#L35-3 assume !(main_~q~0 <= main_~x~0); 12613#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12587#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12583#L35-3 [2018-11-28 12:24:39,323 INFO L796 eck$LassoCheckResult]: Loop: 12583#L35-3 assume !!(main_~q~0 <= main_~x~0); 12584#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12631#partsENTRY ~p := #in~p;~q := #in~q; 12636#L20 assume !(~p <= 0); 12634#L21 assume ~q <= 0;#res := 0; 12633#partsFINAL assume true; 12630#partsEXIT >#67#return; 12628#L36-1 havoc main_#t~ret8; 12627#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12626#L35-3 assume !!(main_~q~0 <= main_~x~0); 12325#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12624#partsENTRY ~p := #in~p;~q := #in~q; 12471#L20 assume !(~p <= 0); 12473#L21 assume !(~q <= 0); 12440#L22 assume !(~q > ~p); 12386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume !(~q <= 0); 12450#L22 assume !(~q > ~p); 12384#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume ~q <= 0;#res := 0; 12553#partsFINAL assume true; 12548#partsEXIT >#65#return; 12546#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12545#partsFINAL assume true; 12380#partsEXIT >#65#return; 12345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12343#partsFINAL assume true; 12344#partsEXIT >#67#return; 12497#L36-1 havoc main_#t~ret8; 12537#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12493#L35-3 assume !!(main_~q~0 <= main_~x~0); 12323#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12477#partsENTRY ~p := #in~p;~q := #in~q; 12478#L20 assume !(~p <= 0); 12443#L21 assume !(~q <= 0); 12440#L22 assume !(~q > ~p); 12386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume !(~q <= 0); 12450#L22 assume !(~q > ~p); 12384#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12437#partsENTRY ~p := #in~p;~q := #in~q; 12447#L20 assume ~p <= 0;#res := 1; 12445#partsFINAL assume true; 12409#partsEXIT >#63#return; 12388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12396#partsENTRY ~p := #in~p;~q := #in~q; 12538#L20 assume !(~p <= 0); 12540#L21 assume ~q <= 0;#res := 0; 12553#partsFINAL assume true; 12548#partsEXIT >#65#return; 12546#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12545#partsFINAL assume true; 12380#partsEXIT >#65#return; 12345#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12343#partsFINAL assume true; 12344#partsEXIT >#67#return; 12496#L36-1 havoc main_#t~ret8; 12335#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12336#L35-3 assume !(main_~q~0 <= main_~x~0); 12264#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12265#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12583#L35-3 [2018-11-28 12:24:39,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 5 times [2018-11-28 12:24:39,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:39,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:39,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1956855493, now seen corresponding path program 4 times [2018-11-28 12:24:39,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:39,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 39 proven. 89 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-28 12:24:39,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:39,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:39,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:24:39,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:24:39,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:39,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-28 12:24:39,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:39,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 12:24:39,553 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:24:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:24:39,554 INFO L87 Difference]: Start difference. First operand 1012 states and 1822 transitions. cyclomatic complexity: 832 Second operand 16 states. [2018-11-28 12:24:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:40,015 INFO L93 Difference]: Finished difference Result 1321 states and 2044 transitions. [2018-11-28 12:24:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:24:40,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1321 states and 2044 transitions. [2018-11-28 12:24:40,027 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 152 [2018-11-28 12:24:40,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1321 states to 1218 states and 1939 transitions. [2018-11-28 12:24:40,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2018-11-28 12:24:40,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 653 [2018-11-28 12:24:40,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1218 states and 1939 transitions. [2018-11-28 12:24:40,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:40,044 INFO L705 BuchiCegarLoop]: Abstraction has 1218 states and 1939 transitions. [2018-11-28 12:24:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 1939 transitions. [2018-11-28 12:24:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1059. [2018-11-28 12:24:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-28 12:24:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1682 transitions. [2018-11-28 12:24:40,074 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1682 transitions. [2018-11-28 12:24:40,074 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1682 transitions. [2018-11-28 12:24:40,074 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 12:24:40,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1682 transitions. [2018-11-28 12:24:40,080 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 131 [2018-11-28 12:24:40,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:40,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:40,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:40,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:24:40,081 INFO L794 eck$LassoCheckResult]: Stem: 14895#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 14880#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 14881#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 14882#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 14883#L35-3 assume !!(main_~q~0 <= main_~x~0); 14943#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 14944#partsENTRY ~p := #in~p;~q := #in~q; 15711#L20 assume ~p <= 0;#res := 1; 15710#partsFINAL assume true; 15709#partsEXIT >#67#return; 15708#L36-1 havoc main_#t~ret8; 14909#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 14889#L35-3 assume !!(main_~q~0 <= main_~x~0); 14890#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 15714#partsENTRY ~p := #in~p;~q := #in~q; 15838#L20 assume !(~p <= 0); 15834#L21 assume !(~q <= 0); 15831#L22 assume ~q > ~p; 14871#L22-1 call #t~ret0 := parts(~p, ~p);< 15560#partsENTRY ~p := #in~p;~q := #in~q; 14898#L20 [2018-11-28 12:24:40,081 INFO L796 eck$LassoCheckResult]: Loop: 14898#L20 assume !(~p <= 0); 14926#L21 assume !(~q <= 0); 14913#L22 assume ~q > ~p; 14897#L22-1 call #t~ret0 := parts(~p, ~p);< 14896#partsENTRY ~p := #in~p;~q := #in~q; 14898#L20 [2018-11-28 12:24:40,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1326047351, now seen corresponding path program 1 times [2018-11-28 12:24:40,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:40,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:40,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:24:40,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:40,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:24:40,108 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:40,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash 32573994, now seen corresponding path program 1 times [2018-11-28 12:24:40,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:40,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:40,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:40,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:40,158 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:40,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:40,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:40,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:40,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:40,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:40,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:40,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:40,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 12:24:40,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:40,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:40,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,212 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:40,212 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:40,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:40,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:40,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:40,231 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:40,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:40,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:40,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:40,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:40,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:40,285 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:40,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:40,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:40,633 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:40,635 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:40,635 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:40,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:40,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:40,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:40,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:40,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:40,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:40,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-28 12:24:40,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:40,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:40,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:40,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:40,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:40,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:40,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:40,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:40,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:40,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:40,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:40,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:40,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:40,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:40,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:40,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:40,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:40,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:40,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:40,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:40,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:40,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:40,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:40,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:40,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:40,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:40,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:40,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:40,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:40,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:40,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:40,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:40,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:40,693 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:24:40,693 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:40,693 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:40,694 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:40,694 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-11-28 12:24:40,694 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:40,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:40,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:40,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-11-28 12:24:40,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1063 states and 1686 transitions. Complement of second has 6 states. [2018-11-28 12:24:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:24:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 12:24:40,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-28 12:24:40,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:40,812 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:40,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:40,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:40,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-11-28 12:24:40,916 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1063 states and 1686 transitions. Complement of second has 6 states. [2018-11-28 12:24:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:24:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 12:24:40,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-28 12:24:40,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:40,917 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:40,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:40,990 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:40,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643 Second operand 6 states. [2018-11-28 12:24:41,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1059 states and 1682 transitions. cyclomatic complexity: 643. Second operand 6 states. Result 1433 states and 2139 transitions. Complement of second has 31 states. [2018-11-28 12:24:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:24:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-28 12:24:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-28 12:24:41,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:41,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-28 12:24:41,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:41,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-28 12:24:41,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:41,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1433 states and 2139 transitions. [2018-11-28 12:24:41,094 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 138 [2018-11-28 12:24:41,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1433 states to 1141 states and 1800 transitions. [2018-11-28 12:24:41,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 468 [2018-11-28 12:24:41,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 539 [2018-11-28 12:24:41,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1141 states and 1800 transitions. [2018-11-28 12:24:41,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:41,104 INFO L705 BuchiCegarLoop]: Abstraction has 1141 states and 1800 transitions. [2018-11-28 12:24:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states and 1800 transitions. [2018-11-28 12:24:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1123. [2018-11-28 12:24:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2018-11-28 12:24:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1782 transitions. [2018-11-28 12:24:41,124 INFO L728 BuchiCegarLoop]: Abstraction has 1123 states and 1782 transitions. [2018-11-28 12:24:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:24:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:24:41,124 INFO L87 Difference]: Start difference. First operand 1123 states and 1782 transitions. Second operand 5 states. [2018-11-28 12:24:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:41,153 INFO L93 Difference]: Finished difference Result 964 states and 1532 transitions. [2018-11-28 12:24:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:24:41,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 964 states and 1532 transitions. [2018-11-28 12:24:41,159 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 99 [2018-11-28 12:24:41,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 964 states to 947 states and 1514 transitions. [2018-11-28 12:24:41,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-11-28 12:24:41,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-11-28 12:24:41,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 947 states and 1514 transitions. [2018-11-28 12:24:41,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:41,166 INFO L705 BuchiCegarLoop]: Abstraction has 947 states and 1514 transitions. [2018-11-28 12:24:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states and 1514 transitions. [2018-11-28 12:24:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2018-11-28 12:24:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2018-11-28 12:24:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1511 transitions. [2018-11-28 12:24:41,181 INFO L728 BuchiCegarLoop]: Abstraction has 944 states and 1511 transitions. [2018-11-28 12:24:41,181 INFO L608 BuchiCegarLoop]: Abstraction has 944 states and 1511 transitions. [2018-11-28 12:24:41,181 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 12:24:41,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 944 states and 1511 transitions. [2018-11-28 12:24:41,185 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 99 [2018-11-28 12:24:41,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:41,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:41,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:41,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2018-11-28 12:24:41,186 INFO L794 eck$LassoCheckResult]: Stem: 21901#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 21895#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 21896#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 21897#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 21898#L35-3 assume !!(main_~q~0 <= main_~x~0); 21904#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21945#partsENTRY ~p := #in~p;~q := #in~q; 22722#L20 assume ~p <= 0;#res := 1; 22721#partsFINAL assume true; 22719#partsEXIT >#67#return; 22712#L36-1 havoc main_#t~ret8; 21923#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 21924#L35-3 assume !!(main_~q~0 <= main_~x~0); 21913#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21912#partsENTRY ~p := #in~p;~q := #in~q; 21914#L20 assume ~p <= 0;#res := 1; 21949#partsFINAL assume true; 22713#partsEXIT >#67#return; 22710#L36-1 havoc main_#t~ret8; 22294#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22263#L35-3 assume !(main_~q~0 <= main_~x~0); 22261#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 22259#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22258#L35-3 [2018-11-28 12:24:41,186 INFO L796 eck$LassoCheckResult]: Loop: 22258#L35-3 assume !!(main_~q~0 <= main_~x~0); 22217#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 22218#partsENTRY ~p := #in~p;~q := #in~q; 22239#L20 assume !(~p <= 0); 22238#L21 assume ~q <= 0;#res := 0; 22236#partsFINAL assume true; 22216#partsEXIT >#67#return; 22214#L36-1 havoc main_#t~ret8; 22212#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22210#L35-3 assume !!(main_~q~0 <= main_~x~0); 21970#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21978#partsENTRY ~p := #in~p;~q := #in~q; 22228#L20 assume !(~p <= 0); 22227#L21 assume !(~q <= 0); 22084#L22 assume !(~q > ~p); 22004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 21993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22188#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 21979#partsFINAL assume true; 21977#partsEXIT >#67#return; 21976#L36-1 havoc main_#t~ret8; 21974#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 21975#L35-3 assume !!(main_~q~0 <= main_~x~0); 21967#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 21972#partsENTRY ~p := #in~p;~q := #in~q; 22102#L20 assume !(~p <= 0); 22085#L21 assume !(~q <= 0); 22084#L22 assume !(~q > ~p); 22004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 21993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume !(~q <= 0); 22072#L22 assume !(~q > ~p); 21996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume !(~p <= 0); 22070#L21 assume !(~q <= 0); 22072#L22 assume !(~q > ~p); 21996#L23 call #t~ret1 := parts(~p - ~q, ~q);< 22063#partsENTRY ~p := #in~p;~q := #in~q; 22068#L20 assume ~p <= 0;#res := 1; 22065#partsFINAL assume true; 22058#partsEXIT >#63#return; 22014#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22039#partsENTRY ~p := #in~p;~q := #in~q; 22149#L20 assume !(~p <= 0); 22150#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22190#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 22197#partsFINAL assume true; 22194#partsEXIT >#63#return; 22049#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 22192#partsENTRY ~p := #in~p;~q := #in~q; 22198#L20 assume !(~p <= 0); 22195#L21 assume ~q <= 0;#res := 0; 22193#partsFINAL assume true; 22186#partsEXIT >#65#return; 22183#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 22180#partsFINAL assume true; 22044#partsEXIT >#65#return; 22046#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 22219#partsFINAL assume true; 22213#partsEXIT >#67#return; 22211#L36-1 havoc main_#t~ret8; 22209#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22208#L35-3 assume !(main_~q~0 <= main_~x~0); 21905#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 21906#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22258#L35-3 [2018-11-28 12:24:41,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 6 times [2018-11-28 12:24:41,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:41,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:41,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:41,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:41,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:41,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1349811523, now seen corresponding path program 5 times [2018-11-28 12:24:41,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:41,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:41,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 53 proven. 126 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-28 12:24:41,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:41,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:41,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 12:24:41,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 12:24:41,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:41,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 56 proven. 122 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-28 12:24:41,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-11-28 12:24:41,402 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:24:41,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:24:41,403 INFO L87 Difference]: Start difference. First operand 944 states and 1511 transitions. cyclomatic complexity: 582 Second operand 17 states. [2018-11-28 12:24:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:41,968 INFO L93 Difference]: Finished difference Result 1055 states and 1641 transitions. [2018-11-28 12:24:41,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 12:24:41,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1641 transitions. [2018-11-28 12:24:41,974 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2018-11-28 12:24:41,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 979 states and 1509 transitions. [2018-11-28 12:24:41,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2018-11-28 12:24:41,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2018-11-28 12:24:41,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 979 states and 1509 transitions. [2018-11-28 12:24:41,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:41,981 INFO L705 BuchiCegarLoop]: Abstraction has 979 states and 1509 transitions. [2018-11-28 12:24:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states and 1509 transitions. [2018-11-28 12:24:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 905. [2018-11-28 12:24:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-28 12:24:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1375 transitions. [2018-11-28 12:24:41,996 INFO L728 BuchiCegarLoop]: Abstraction has 905 states and 1375 transitions. [2018-11-28 12:24:41,996 INFO L608 BuchiCegarLoop]: Abstraction has 905 states and 1375 transitions. [2018-11-28 12:24:41,996 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 12:24:41,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 905 states and 1375 transitions. [2018-11-28 12:24:42,000 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 122 [2018-11-28 12:24:42,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:42,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:42,001 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:42,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 20, 15, 8, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2018-11-28 12:24:42,001 INFO L794 eck$LassoCheckResult]: Stem: 24209#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 24203#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 24204#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 24205#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24206#L35-3 assume !!(main_~q~0 <= main_~x~0); 24702#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24703#partsENTRY ~p := #in~p;~q := #in~q; 24707#L20 assume ~p <= 0;#res := 1; 24705#partsFINAL assume true; 24701#partsEXIT >#67#return; 24699#L36-1 havoc main_#t~ret8; 24698#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24696#L35-3 assume !!(main_~q~0 <= main_~x~0); 24690#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24693#partsENTRY ~p := #in~p;~q := #in~q; 24697#L20 assume ~p <= 0;#res := 1; 24695#partsFINAL assume true; 24689#partsEXIT >#67#return; 24683#L36-1 havoc main_#t~ret8; 24682#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24559#L35-3 assume !(main_~q~0 <= main_~x~0); 24554#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 24478#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24475#L35-3 [2018-11-28 12:24:42,001 INFO L796 eck$LassoCheckResult]: Loop: 24475#L35-3 assume !!(main_~q~0 <= main_~x~0); 24472#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24474#partsENTRY ~p := #in~p;~q := #in~q; 24523#L20 assume !(~p <= 0); 24522#L21 assume ~q <= 0;#res := 0; 24520#partsFINAL assume true; 24471#partsEXIT >#67#return; 24468#L36-1 havoc main_#t~ret8; 24466#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24464#L35-3 assume !!(main_~q~0 <= main_~x~0); 24265#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24420#partsENTRY ~p := #in~p;~q := #in~q; 24481#L20 assume !(~p <= 0); 24480#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24490#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24487#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24486#partsFINAL assume true; 24485#partsEXIT >#67#return; 24424#L36-1 havoc main_#t~ret8; 24422#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24421#L35-3 assume !!(main_~q~0 <= main_~x~0); 24266#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24418#partsENTRY ~p := #in~p;~q := #in~q; 24412#L20 assume !(~p <= 0); 24360#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24491#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24492#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24510#partsFINAL assume true; 24494#partsEXIT >#65#return; 24285#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24456#partsFINAL assume true; 24454#partsEXIT >#67#return; 24455#L36-1 havoc main_#t~ret8; 24453#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24448#L35-3 assume !!(main_~q~0 <= main_~x~0); 24263#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 24418#partsENTRY ~p := #in~p;~q := #in~q; 24412#L20 assume !(~p <= 0); 24360#L21 assume !(~q <= 0); 24322#L22 assume !(~q > ~p); 24277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume !(~p <= 0); 24359#L21 assume !(~q <= 0); 24383#L22 assume !(~q > ~p); 24279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 24330#partsENTRY ~p := #in~p;~q := #in~q; 24357#L20 assume ~p <= 0;#res := 1; 24318#partsFINAL assume true; 24319#partsEXIT >#63#return; 24280#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24288#partsENTRY ~p := #in~p;~q := #in~q; 24546#L20 assume !(~p <= 0); 24544#L21 assume ~q <= 0;#res := 0; 24541#partsFINAL assume true; 24539#partsEXIT >#65#return; 24540#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24570#partsFINAL assume true; 24495#partsEXIT >#63#return; 24491#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 24493#partsENTRY ~p := #in~p;~q := #in~q; 24514#L20 assume !(~p <= 0); 24512#L21 assume ~q <= 0;#res := 0; 24511#partsFINAL assume true; 24489#partsEXIT >#65#return; 24492#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24510#partsFINAL assume true; 24494#partsEXIT >#65#return; 24285#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 24456#partsFINAL assume true; 24454#partsEXIT >#67#return; 24452#L36-1 havoc main_#t~ret8; 24451#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 24449#L35-3 assume !(main_~q~0 <= main_~x~0); 24450#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 24477#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 24475#L35-3 [2018-11-28 12:24:42,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 7 times [2018-11-28 12:24:42,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:42,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:42,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:42,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2133343601, now seen corresponding path program 6 times [2018-11-28 12:24:42,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 241 proven. 108 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-11-28 12:24:42,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:42,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 12:24:42,173 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-28 12:24:42,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:42,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 93 proven. 16 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-11-28 12:24:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2018-11-28 12:24:42,299 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:24:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:24:42,299 INFO L87 Difference]: Start difference. First operand 905 states and 1375 transitions. cyclomatic complexity: 490 Second operand 17 states. [2018-11-28 12:24:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:42,790 INFO L93 Difference]: Finished difference Result 1301 states and 2043 transitions. [2018-11-28 12:24:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 12:24:42,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1301 states and 2043 transitions. [2018-11-28 12:24:42,798 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 179 [2018-11-28 12:24:42,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1301 states to 1270 states and 1996 transitions. [2018-11-28 12:24:42,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 534 [2018-11-28 12:24:42,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 534 [2018-11-28 12:24:42,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 1996 transitions. [2018-11-28 12:24:42,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:42,807 INFO L705 BuchiCegarLoop]: Abstraction has 1270 states and 1996 transitions. [2018-11-28 12:24:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 1996 transitions. [2018-11-28 12:24:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1095. [2018-11-28 12:24:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-11-28 12:24:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1761 transitions. [2018-11-28 12:24:42,825 INFO L728 BuchiCegarLoop]: Abstraction has 1095 states and 1761 transitions. [2018-11-28 12:24:42,825 INFO L608 BuchiCegarLoop]: Abstraction has 1095 states and 1761 transitions. [2018-11-28 12:24:42,825 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 12:24:42,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1095 states and 1761 transitions. [2018-11-28 12:24:42,828 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 138 [2018-11-28 12:24:42,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:42,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:42,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 12:24:42,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:42,829 INFO L794 eck$LassoCheckResult]: Stem: 26926#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 26912#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 26913#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 26914#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 26915#L35-3 assume !!(main_~q~0 <= main_~x~0); 27626#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27628#partsENTRY ~p := #in~p;~q := #in~q; 27631#L20 assume ~p <= 0;#res := 1; 27629#partsFINAL assume true; 27625#partsEXIT >#67#return; 27624#L36-1 havoc main_#t~ret8; 27623#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27622#L35-3 assume !!(main_~q~0 <= main_~x~0); 27466#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27605#partsENTRY ~p := #in~p;~q := #in~q; 27471#L20 assume ~p <= 0;#res := 1; 27465#partsFINAL assume true; 27467#partsEXIT >#67#return; 27618#L36-1 havoc main_#t~ret8; 27617#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27260#L35-3 assume !(main_~q~0 <= main_~x~0); 27258#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 27216#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 27205#L35-3 assume !!(main_~q~0 <= main_~x~0); 27200#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27201#partsENTRY ~p := #in~p;~q := #in~q; 27214#L20 assume ~p <= 0;#res := 1; 27215#partsFINAL assume true; 27409#partsEXIT >#67#return; 27408#L36-1 [2018-11-28 12:24:42,829 INFO L796 eck$LassoCheckResult]: Loop: 27408#L36-1 havoc main_#t~ret8; 27407#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 27406#L35-3 assume !!(main_~q~0 <= main_~x~0); 26906#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 27239#partsENTRY ~p := #in~p;~q := #in~q; 27240#L20 assume ~p <= 0;#res := 1; 27368#partsFINAL assume true; 27411#partsEXIT >#67#return; 27408#L36-1 [2018-11-28 12:24:42,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash -947752702, now seen corresponding path program 8 times [2018-11-28 12:24:42,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:42,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 12:24:42,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:42,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:24:42,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:42,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 2 times [2018-11-28 12:24:42,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:42,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:42,898 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:42,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:42,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:42,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:42,898 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:42,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:42,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:42,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:42,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-11-28 12:24:42,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:42,899 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:42,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:42,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:42,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:42,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:42,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:42,925 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:42,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:42,931 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:42,933 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:42,933 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:42,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:42,958 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:42,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:42,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:43,201 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:43,202 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:43,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:43,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:43,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:43,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:43,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:43,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:43,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:43,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-11-28 12:24:43,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:43,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:43,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:43,222 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:43,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:43,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:43,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:43,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:43,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:43,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:43,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:43,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:43,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:43,226 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:24:43,226 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:43,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:43,226 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:43,226 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:43,227 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~q~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~q~0 Supporting invariants [] [2018-11-28 12:24:43,227 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:43,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:43,290 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:43,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-11-28 12:24:43,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 1114 states and 1782 transitions. Complement of second has 10 states. [2018-11-28 12:24:43,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:24:43,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-28 12:24:43,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:43,322 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:43,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:43,386 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:43,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-11-28 12:24:43,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 1112 states and 1779 transitions. Complement of second has 12 states. [2018-11-28 12:24:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-28 12:24:43,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-28 12:24:43,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:43,427 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:43,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:43,515 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:43,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689 Second operand 7 states. [2018-11-28 12:24:43,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1095 states and 1761 transitions. cyclomatic complexity: 689. Second operand 7 states. Result 2120 states and 3443 transitions. Complement of second has 13 states. [2018-11-28 12:24:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-28 12:24:43,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-28 12:24:43,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:43,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-28 12:24:43,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:43,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 16 letters. [2018-11-28 12:24:43,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:43,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2120 states and 3443 transitions. [2018-11-28 12:24:43,593 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 117 [2018-11-28 12:24:43,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2120 states to 1532 states and 2468 transitions. [2018-11-28 12:24:43,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-28 12:24:43,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2018-11-28 12:24:43,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1532 states and 2468 transitions. [2018-11-28 12:24:43,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:43,609 INFO L705 BuchiCegarLoop]: Abstraction has 1532 states and 2468 transitions. [2018-11-28 12:24:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states and 2468 transitions. [2018-11-28 12:24:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1472. [2018-11-28 12:24:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2018-11-28 12:24:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2395 transitions. [2018-11-28 12:24:43,642 INFO L728 BuchiCegarLoop]: Abstraction has 1472 states and 2395 transitions. [2018-11-28 12:24:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:24:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:24:43,643 INFO L87 Difference]: Start difference. First operand 1472 states and 2395 transitions. Second operand 6 states. [2018-11-28 12:24:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:43,726 INFO L93 Difference]: Finished difference Result 1293 states and 2125 transitions. [2018-11-28 12:24:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:24:43,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 2125 transitions. [2018-11-28 12:24:43,733 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-11-28 12:24:43,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 699 states and 1167 transitions. [2018-11-28 12:24:43,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2018-11-28 12:24:43,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2018-11-28 12:24:43,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 699 states and 1167 transitions. [2018-11-28 12:24:43,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:43,739 INFO L705 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-11-28 12:24:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states and 1167 transitions. [2018-11-28 12:24:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-11-28 12:24:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-28 12:24:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1167 transitions. [2018-11-28 12:24:43,750 INFO L728 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-11-28 12:24:43,750 INFO L608 BuchiCegarLoop]: Abstraction has 699 states and 1167 transitions. [2018-11-28 12:24:43,750 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 12:24:43,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 699 states and 1167 transitions. [2018-11-28 12:24:43,753 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-11-28 12:24:43,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:43,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:43,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:43,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:24:43,753 INFO L794 eck$LassoCheckResult]: Stem: 35541#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 35531#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 35532#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 35533#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 35534#L35-3 assume !!(main_~q~0 <= main_~x~0); 35634#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35635#partsENTRY ~p := #in~p;~q := #in~q; 35639#L20 assume ~p <= 0;#res := 1; 35638#partsFINAL assume true; 35633#partsEXIT >#67#return; 35631#L36-1 havoc main_#t~ret8; 35630#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35629#L35-3 assume !!(main_~q~0 <= main_~x~0); 35623#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35627#partsENTRY ~p := #in~p;~q := #in~q; 35622#L20 assume ~p <= 0;#res := 1; 35624#partsFINAL assume true; 35652#partsEXIT >#67#return; 35603#L36-1 havoc main_#t~ret8; 35604#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35979#L35-3 assume !(main_~q~0 <= main_~x~0); 35539#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 35540#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 35605#L35-3 assume !!(main_~q~0 <= main_~x~0); 35606#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35619#partsENTRY ~p := #in~p;~q := #in~q; 35618#L20 assume !(~p <= 0); 35617#L21 assume ~q <= 0;#res := 0; 35615#partsFINAL assume true; 35616#partsEXIT >#67#return; 35817#L36-1 havoc main_#t~ret8; 35814#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 35812#L35-3 assume !!(main_~q~0 <= main_~x~0); 35520#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 35730#partsENTRY ~p := #in~p;~q := #in~q; 35727#L20 assume !(~p <= 0); 35729#L21 assume !(~q <= 0); 36082#L22 assume !(~q > ~p); 35554#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35719#partsENTRY [2018-11-28 12:24:43,754 INFO L796 eck$LassoCheckResult]: Loop: 35719#partsENTRY ~p := #in~p;~q := #in~q; 36079#L20 assume !(~p <= 0); 36051#L21 assume !(~q <= 0); 36050#L22 assume !(~q > ~p); 35558#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35719#partsENTRY [2018-11-28 12:24:43,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -69867016, now seen corresponding path program 1 times [2018-11-28 12:24:43,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:43,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:43,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 2 times [2018-11-28 12:24:43,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:43,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1638367868, now seen corresponding path program 2 times [2018-11-28 12:24:43,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:43,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 12:24:43,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:43,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:43,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:24:43,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:24:43,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:43,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 12:24:43,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:43,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 12:24:43,896 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:43,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:43,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:43,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:43,896 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:43,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:43,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:43,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:43,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-11-28 12:24:43,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:43,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:43,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:43,936 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:43,937 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:43,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:43,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:43,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:43,945 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:43,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:43,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:43,961 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:43,961 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:43,976 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:43,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:43,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:43,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/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-28 12:24:43,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:43,993 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:43,995 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:43,995 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:44,010 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:44,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:44,075 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:44,076 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:44,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:44,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:44,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:44,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:44,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:44,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:44,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-11-28 12:24:44,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:44,076 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:44,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,105 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:44,105 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:44,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:44,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:44,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:44,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:44,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:44,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:44,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:44,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:44,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:44,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:44,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:44,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:44,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:44,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:44,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:44,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:44,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:44,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:44,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:44,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:44,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:44,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:44,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:44,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:44,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:44,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:44,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:44,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:44,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:44,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:44,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:44,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:44,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:44,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:44,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:44,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:44,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:44,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:44,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:44,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:44,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:44,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:44,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:44,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:44,114 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:44,115 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:44,115 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:44,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:44,115 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:44,115 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:44,115 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-11-28 12:24:44,116 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:44,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:44,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:44,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:44,187 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:24:44,188 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 699 states and 1167 transitions. cyclomatic complexity: 485 Second operand 6 states. [2018-11-28 12:24:44,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 699 states and 1167 transitions. cyclomatic complexity: 485. Second operand 6 states. Result 912 states and 1536 transitions. Complement of second has 24 states. [2018-11-28 12:24:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:24:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2018-11-28 12:24:44,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 39 letters. Loop has 5 letters. [2018-11-28 12:24:44,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:44,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 44 letters. Loop has 5 letters. [2018-11-28 12:24:44,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:44,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 34 transitions. Stem has 39 letters. Loop has 10 letters. [2018-11-28 12:24:44,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:44,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 912 states and 1536 transitions. [2018-11-28 12:24:44,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-11-28 12:24:44,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 912 states to 840 states and 1399 transitions. [2018-11-28 12:24:44,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2018-11-28 12:24:44,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 12:24:44,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 840 states and 1399 transitions. [2018-11-28 12:24:44,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:44,271 INFO L705 BuchiCegarLoop]: Abstraction has 840 states and 1399 transitions. [2018-11-28 12:24:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states and 1399 transitions. [2018-11-28 12:24:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 800. [2018-11-28 12:24:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-11-28 12:24:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1327 transitions. [2018-11-28 12:24:44,294 INFO L728 BuchiCegarLoop]: Abstraction has 800 states and 1327 transitions. [2018-11-28 12:24:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:24:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:24:44,294 INFO L87 Difference]: Start difference. First operand 800 states and 1327 transitions. Second operand 10 states. [2018-11-28 12:24:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:44,401 INFO L93 Difference]: Finished difference Result 721 states and 1014 transitions. [2018-11-28 12:24:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:24:44,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 1014 transitions. [2018-11-28 12:24:44,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2018-11-28 12:24:44,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 647 states and 912 transitions. [2018-11-28 12:24:44,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2018-11-28 12:24:44,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2018-11-28 12:24:44,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 912 transitions. [2018-11-28 12:24:44,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:44,433 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 912 transitions. [2018-11-28 12:24:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 912 transitions. [2018-11-28 12:24:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 544. [2018-11-28 12:24:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-28 12:24:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 780 transitions. [2018-11-28 12:24:44,441 INFO L728 BuchiCegarLoop]: Abstraction has 544 states and 780 transitions. [2018-11-28 12:24:44,441 INFO L608 BuchiCegarLoop]: Abstraction has 544 states and 780 transitions. [2018-11-28 12:24:44,441 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 12:24:44,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 544 states and 780 transitions. [2018-11-28 12:24:44,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2018-11-28 12:24:44,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:44,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:44,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:44,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:44,444 INFO L794 eck$LassoCheckResult]: Stem: 38993#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 38985#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 38986#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 38987#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 38988#L35-3 assume !!(main_~q~0 <= main_~x~0); 39071#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39072#partsENTRY ~p := #in~p;~q := #in~q; 39076#L20 assume ~p <= 0;#res := 1; 39075#partsFINAL assume true; 39070#partsEXIT >#67#return; 39068#L36-1 havoc main_#t~ret8; 39067#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 39066#L35-3 assume !!(main_~q~0 <= main_~x~0); 39060#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39064#partsENTRY ~p := #in~p;~q := #in~q; 39059#L20 assume ~p <= 0;#res := 1; 39061#partsFINAL assume true; 39085#partsEXIT >#67#return; 39086#L36-1 havoc main_#t~ret8; 39270#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 39269#L35-3 assume !(main_~q~0 <= main_~x~0); 38994#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 38995#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 39042#L35-3 assume !!(main_~q~0 <= main_~x~0); 39046#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39050#partsENTRY ~p := #in~p;~q := #in~q; 39049#L20 assume !(~p <= 0); 39048#L21 assume ~q <= 0;#res := 0; 39045#partsFINAL assume true; 39047#partsEXIT >#67#return; 39118#L36-1 havoc main_#t~ret8; 39116#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 39114#L35-3 assume !!(main_~q~0 <= main_~x~0); 38982#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 39100#partsENTRY ~p := #in~p;~q := #in~q; 39414#L20 assume !(~p <= 0); 39015#L21 [2018-11-28 12:24:44,444 INFO L796 eck$LassoCheckResult]: Loop: 39015#L21 assume !(~q <= 0); 39008#L22 assume !(~q > ~p); 38974#L23 call #t~ret1 := parts(~p - ~q, ~q);< 38981#partsENTRY ~p := #in~p;~q := #in~q; 38996#L20 assume ~p <= 0;#res := 1; 39000#partsFINAL assume true; 38973#partsEXIT >#63#return; 38975#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 39005#partsENTRY ~p := #in~p;~q := #in~q; 39514#L20 assume !(~p <= 0); 39015#L21 [2018-11-28 12:24:44,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash 923694592, now seen corresponding path program 1 times [2018-11-28 12:24:44,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2119110563, now seen corresponding path program 1 times [2018-11-28 12:24:44,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1799408740, now seen corresponding path program 1 times [2018-11-28 12:24:44,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:44,545 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:44,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:44,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:44,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:44,545 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:44,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:44,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:44,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-11-28 12:24:44,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:44,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:44,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:44,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:44,592 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:44,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:44,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:44,603 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:44,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:44,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:44,621 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:44,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:44,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:44,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:44,669 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:44,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:44,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:45,105 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:45,106 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:45,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:45,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:45,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:45,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:45,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:45,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:45,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:45,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-11-28 12:24:45,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:45,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:45,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:45,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:45,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:45,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:45,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:45,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:45,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:45,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:45,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:45,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:45,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:45,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:45,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:45,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:45,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:45,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:45,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:45,152 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:24:45,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:45,152 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:45,152 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:45,152 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-11-28 12:24:45,152 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:45,241 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:24:45,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-11-28 12:24:45,259 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 546 states and 782 transitions. Complement of second has 6 states. [2018-11-28 12:24:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:24:45,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 36 letters. Loop has 10 letters. [2018-11-28 12:24:45,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:45,260 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:45,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:24:45,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-11-28 12:24:45,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 546 states and 782 transitions. Complement of second has 6 states. [2018-11-28 12:24:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:24:45,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 36 letters. Loop has 10 letters. [2018-11-28 12:24:45,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:45,339 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:24:45,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:45,403 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:24:45,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249 Second operand 7 states. [2018-11-28 12:24:45,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 544 states and 780 transitions. cyclomatic complexity: 249. Second operand 7 states. Result 2324 states and 3015 transitions. Complement of second has 75 states. [2018-11-28 12:24:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:24:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-11-28 12:24:45,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 36 letters. Loop has 10 letters. [2018-11-28 12:24:45,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:45,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 46 letters. Loop has 10 letters. [2018-11-28 12:24:45,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:45,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 60 transitions. Stem has 36 letters. Loop has 20 letters. [2018-11-28 12:24:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:45,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2324 states and 3015 transitions. [2018-11-28 12:24:45,534 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 104 [2018-11-28 12:24:45,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2324 states to 938 states and 1288 transitions. [2018-11-28 12:24:45,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-28 12:24:45,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2018-11-28 12:24:45,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 938 states and 1288 transitions. [2018-11-28 12:24:45,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:45,542 INFO L705 BuchiCegarLoop]: Abstraction has 938 states and 1288 transitions. [2018-11-28 12:24:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states and 1288 transitions. [2018-11-28 12:24:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 687. [2018-11-28 12:24:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-28 12:24:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 866 transitions. [2018-11-28 12:24:45,559 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 866 transitions. [2018-11-28 12:24:45,560 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 866 transitions. [2018-11-28 12:24:45,560 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 12:24:45,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 866 transitions. [2018-11-28 12:24:45,561 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2018-11-28 12:24:45,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:45,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:45,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:45,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:45,562 INFO L794 eck$LassoCheckResult]: Stem: 43493#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 43489#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 43490#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 43491#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 43492#L35-3 assume !!(main_~q~0 <= main_~x~0); 43569#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43570#partsENTRY ~p := #in~p;~q := #in~q; 43574#L20 assume ~p <= 0;#res := 1; 43573#partsFINAL assume true; 43568#partsEXIT >#67#return; 43566#L36-1 havoc main_#t~ret8; 43565#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43564#L35-3 assume !!(main_~q~0 <= main_~x~0); 43559#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43562#partsENTRY ~p := #in~p;~q := #in~q; 43558#L20 assume ~p <= 0;#res := 1; 43560#partsFINAL assume true; 43576#partsEXIT >#67#return; 43577#L36-1 havoc main_#t~ret8; 43507#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43508#L35-3 assume !(main_~q~0 <= main_~x~0); 43498#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 43499#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 43546#L35-3 assume !!(main_~q~0 <= main_~x~0); 43539#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43540#partsENTRY ~p := #in~p;~q := #in~q; 43556#L20 assume !(~p <= 0); 43554#L21 assume ~q <= 0;#res := 0; 43555#partsFINAL assume true; 43547#partsEXIT >#67#return; 43527#L36-1 havoc main_#t~ret8; 43528#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 43599#L35-3 assume !!(main_~q~0 <= main_~x~0); 43488#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 43595#partsENTRY ~p := #in~p;~q := #in~q; 43535#L20 assume !(~p <= 0); 43537#L21 assume !(~q <= 0); 44140#L22 assume !(~q > ~p); 43485#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43487#partsENTRY ~p := #in~p;~q := #in~q; 44148#L20 assume ~p <= 0;#res := 1; 44147#partsFINAL assume true; 44146#partsEXIT >#63#return; 43486#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 44145#partsENTRY ~p := #in~p;~q := #in~q; 44144#L20 assume !(~p <= 0); 44125#L21 assume !(~q <= 0); 44159#L22 assume ~q > ~p; 43827#L22-1 call #t~ret0 := parts(~p, ~p);< 44128#partsENTRY ~p := #in~p;~q := #in~q; 44127#L20 assume !(~p <= 0); 44123#L21 [2018-11-28 12:24:45,562 INFO L796 eck$LassoCheckResult]: Loop: 44123#L21 assume !(~q <= 0); 44116#L22 assume !(~q > ~p); 43821#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43825#partsENTRY ~p := #in~p;~q := #in~q; 43828#L20 assume ~p <= 0;#res := 1; 43826#partsFINAL assume true; 43819#partsEXIT >#63#return; 43823#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 44126#partsENTRY ~p := #in~p;~q := #in~q; 44124#L20 assume !(~p <= 0); 44125#L21 assume !(~q <= 0); 44159#L22 assume ~q > ~p; 43827#L22-1 call #t~ret0 := parts(~p, ~p);< 44128#partsENTRY ~p := #in~p;~q := #in~q; 44127#L20 assume !(~p <= 0); 44123#L21 [2018-11-28 12:24:45,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1670165695, now seen corresponding path program 1 times [2018-11-28 12:24:45,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:45,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:45,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:45,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 12:24:45,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:45,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-28 12:24:45,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:45,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-28 12:24:45,811 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:45,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash 915300128, now seen corresponding path program 1 times [2018-11-28 12:24:45,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:45,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:45,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:24:45,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:24:45,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:24:45,826 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:24:45,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:24:45,827 INFO L87 Difference]: Start difference. First operand 687 states and 866 transitions. cyclomatic complexity: 200 Second operand 5 states. [2018-11-28 12:24:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:45,875 INFO L93 Difference]: Finished difference Result 705 states and 886 transitions. [2018-11-28 12:24:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:24:45,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 886 transitions. [2018-11-28 12:24:45,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-28 12:24:45,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 662 states and 836 transitions. [2018-11-28 12:24:45,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-28 12:24:45,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-28 12:24:45,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 836 transitions. [2018-11-28 12:24:45,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:45,884 INFO L705 BuchiCegarLoop]: Abstraction has 662 states and 836 transitions. [2018-11-28 12:24:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 836 transitions. [2018-11-28 12:24:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 626. [2018-11-28 12:24:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-28 12:24:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 786 transitions. [2018-11-28 12:24:45,894 INFO L728 BuchiCegarLoop]: Abstraction has 626 states and 786 transitions. [2018-11-28 12:24:45,894 INFO L608 BuchiCegarLoop]: Abstraction has 626 states and 786 transitions. [2018-11-28 12:24:45,894 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 12:24:45,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 786 transitions. [2018-11-28 12:24:45,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2018-11-28 12:24:45,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:45,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:45,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:45,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 7, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-28 12:24:45,901 INFO L794 eck$LassoCheckResult]: Stem: 45051#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 45047#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 45048#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 45049#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45050#L35-3 assume !!(main_~q~0 <= main_~x~0); 45121#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45122#partsENTRY ~p := #in~p;~q := #in~q; 45126#L20 assume ~p <= 0;#res := 1; 45125#partsFINAL assume true; 45120#partsEXIT >#67#return; 45118#L36-1 havoc main_#t~ret8; 45117#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45116#L35-3 assume !!(main_~q~0 <= main_~x~0); 45111#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45114#partsENTRY ~p := #in~p;~q := #in~q; 45110#L20 assume ~p <= 0;#res := 1; 45112#partsFINAL assume true; 45130#partsEXIT >#67#return; 45095#L36-1 havoc main_#t~ret8; 45067#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45068#L35-3 assume !(main_~q~0 <= main_~x~0); 45056#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 45057#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45096#L35-3 assume !!(main_~q~0 <= main_~x~0); 45088#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45089#partsENTRY ~p := #in~p;~q := #in~q; 45108#L20 assume !(~p <= 0); 45106#L21 assume ~q <= 0;#res := 0; 45107#partsFINAL assume true; 45097#partsEXIT >#67#return; 45098#L36-1 havoc main_#t~ret8; 45149#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45147#L35-3 assume !!(main_~q~0 <= main_~x~0); 45143#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45144#partsENTRY ~p := #in~p;~q := #in~q; 45162#L20 assume !(~p <= 0); 45160#L21 assume !(~q <= 0); 45161#L22 assume !(~q > ~p); 45254#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45255#partsENTRY ~p := #in~p;~q := #in~q; 45277#L20 assume ~p <= 0;#res := 1; 45276#partsFINAL assume true; 45253#partsEXIT >#63#return; 45250#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45251#partsENTRY ~p := #in~p;~q := #in~q; 45280#L20 assume !(~p <= 0); 45279#L21 assume ~q <= 0;#res := 0; 45278#partsFINAL assume true; 45249#partsEXIT >#65#return; 45247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 45246#partsFINAL assume true; 45245#partsEXIT >#67#return; 45243#L36-1 havoc main_#t~ret8; 45242#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45133#L35-3 assume !!(main_~q~0 <= main_~x~0); 45102#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45180#partsENTRY ~p := #in~p;~q := #in~q; 45188#L20 assume !(~p <= 0); 45187#L21 assume !(~q <= 0); 45186#L22 assume ~q > ~p; 45128#L22-1 call #t~ret0 := parts(~p, ~p);< 45129#partsENTRY ~p := #in~p;~q := #in~q; 45554#L20 assume !(~p <= 0); 45550#L21 assume !(~q <= 0); 45545#L22 assume !(~q > ~p); 45541#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45543#partsENTRY ~p := #in~p;~q := #in~q; 45552#L20 assume ~p <= 0;#res := 1; 45548#partsFINAL assume true; 45540#partsEXIT >#63#return; 45537#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45539#partsENTRY ~p := #in~p;~q := #in~q; 45602#L20 assume !(~p <= 0); 45601#L21 assume ~q <= 0;#res := 0; 45600#partsFINAL assume true; 45536#partsEXIT >#65#return; 45534#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 45515#partsFINAL assume true; 45127#partsEXIT >#61#return; 45113#L22-2 #res := #t~ret0;havoc #t~ret0; 45109#partsFINAL assume true; 45101#partsEXIT >#67#return; 45103#L36-1 [2018-11-28 12:24:45,901 INFO L796 eck$LassoCheckResult]: Loop: 45103#L36-1 havoc main_#t~ret8; 45177#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45176#L35-3 assume !(main_~q~0 <= main_~x~0); 45175#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 45166#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 45052#L35-3 assume !!(main_~q~0 <= main_~x~0); 45053#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45153#partsENTRY ~p := #in~p;~q := #in~q; 45158#L20 assume !(~p <= 0); 45157#L21 assume ~q <= 0;#res := 0; 45099#partsFINAL assume true; 45100#partsEXIT >#67#return; 45075#L36-1 havoc main_#t~ret8; 45069#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45054#L35-3 assume !!(main_~q~0 <= main_~x~0); 45055#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45145#partsENTRY ~p := #in~p;~q := #in~q; 45226#L20 assume !(~p <= 0); 45227#L21 assume !(~q <= 0); 45266#L22 assume ~q > ~p; 45264#L22-1 call #t~ret0 := parts(~p, ~p);< 45265#partsENTRY ~p := #in~p;~q := #in~q; 45426#L20 assume !(~p <= 0); 45425#L21 assume !(~q <= 0); 45421#L22 assume !(~q > ~p); 45416#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45418#partsENTRY ~p := #in~p;~q := #in~q; 45423#L20 assume ~p <= 0;#res := 1; 45420#partsFINAL assume true; 45415#partsEXIT >#63#return; 45406#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45409#partsENTRY ~p := #in~p;~q := #in~q; 45433#L20 assume !(~p <= 0); 45431#L21 assume ~q <= 0;#res := 0; 45430#partsFINAL assume true; 45405#partsEXIT >#65#return; 45403#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 45402#partsFINAL assume true; 45263#partsEXIT >#61#return; 45262#L22-2 #res := #t~ret0;havoc #t~ret0; 45260#partsFINAL assume true; 45141#partsEXIT >#67#return; 45139#L36-1 havoc main_#t~ret8; 45135#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 45136#L35-3 assume !!(main_~q~0 <= main_~x~0); 45104#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 45105#partsENTRY ~p := #in~p;~q := #in~q; 45505#L20 assume !(~p <= 0); 45504#L21 assume !(~q <= 0); 45503#L22 assume ~q > ~p; 45184#L22-1 call #t~ret0 := parts(~p, ~p);< 45501#partsENTRY ~p := #in~p;~q := #in~q; 45499#L20 assume !(~p <= 0); 45497#L21 assume !(~q <= 0); 45487#L22 assume !(~q > ~p); 45485#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45486#partsENTRY ~p := #in~p;~q := #in~q; 45491#L20 assume ~p <= 0;#res := 1; 45489#partsFINAL assume true; 45480#partsEXIT >#63#return; 45466#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45469#partsENTRY ~p := #in~p;~q := #in~q; 45507#L20 assume !(~p <= 0); 45506#L21 assume ~q <= 0;#res := 0; 45502#partsFINAL assume true; 45464#partsEXIT >#65#return; 45462#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 45461#partsFINAL assume true; 45183#partsEXIT >#61#return; 45182#L22-2 #res := #t~ret0;havoc #t~ret0; 45181#partsFINAL assume true; 45178#partsEXIT >#67#return; 45103#L36-1 [2018-11-28 12:24:45,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1556014239, now seen corresponding path program 1 times [2018-11-28 12:24:45,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:45,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-11-28 12:24:45,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:45,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:45,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:45,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-28 12:24:46,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:46,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 12:24:46,053 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:46,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 812347193, now seen corresponding path program 1 times [2018-11-28 12:24:46,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:46,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 27 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-28 12:24:46,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:46,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:46,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:46,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 124 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-28 12:24:46,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 12:24:46,178 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:24:46,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:24:46,178 INFO L87 Difference]: Start difference. First operand 626 states and 786 transitions. cyclomatic complexity: 176 Second operand 8 states. [2018-11-28 12:24:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:46,260 INFO L93 Difference]: Finished difference Result 766 states and 1069 transitions. [2018-11-28 12:24:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:24:46,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 766 states and 1069 transitions. [2018-11-28 12:24:46,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-11-28 12:24:46,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 766 states to 766 states and 1069 transitions. [2018-11-28 12:24:46,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-28 12:24:46,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-28 12:24:46,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 766 states and 1069 transitions. [2018-11-28 12:24:46,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:46,269 INFO L705 BuchiCegarLoop]: Abstraction has 766 states and 1069 transitions. [2018-11-28 12:24:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states and 1069 transitions. [2018-11-28 12:24:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 648. [2018-11-28 12:24:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-28 12:24:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 828 transitions. [2018-11-28 12:24:46,280 INFO L728 BuchiCegarLoop]: Abstraction has 648 states and 828 transitions. [2018-11-28 12:24:46,280 INFO L608 BuchiCegarLoop]: Abstraction has 648 states and 828 transitions. [2018-11-28 12:24:46,280 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 12:24:46,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 648 states and 828 transitions. [2018-11-28 12:24:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-11-28 12:24:46,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:46,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:46,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:46,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:46,282 INFO L794 eck$LassoCheckResult]: Stem: 46927#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 46923#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 46924#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 46925#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46926#L35-3 assume !!(main_~q~0 <= main_~x~0); 47020#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47021#partsENTRY ~p := #in~p;~q := #in~q; 47025#L20 assume ~p <= 0;#res := 1; 47024#partsFINAL assume true; 47019#partsEXIT >#67#return; 47015#L36-1 havoc main_#t~ret8; 47010#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47009#L35-3 assume !!(main_~q~0 <= main_~x~0); 47000#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47003#partsENTRY ~p := #in~p;~q := #in~q; 46999#L20 assume ~p <= 0;#res := 1; 47001#partsFINAL assume true; 47012#partsEXIT >#67#return; 47013#L36-1 havoc main_#t~ret8; 47138#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47137#L35-3 assume !(main_~q~0 <= main_~x~0); 47136#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 47135#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 47134#L35-3 assume !!(main_~q~0 <= main_~x~0); 46978#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 46979#partsENTRY ~p := #in~p;~q := #in~q; 46998#L20 assume !(~p <= 0); 46997#L21 assume ~q <= 0;#res := 0; 46996#partsFINAL assume true; 46994#partsEXIT >#67#return; 46995#L36-1 havoc main_#t~ret8; 47124#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47121#L35-3 assume !!(main_~q~0 <= main_~x~0); 47109#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47111#partsENTRY ~p := #in~p;~q := #in~q; 47152#L20 assume !(~p <= 0); 47155#L21 assume !(~q <= 0); 47156#L22 assume !(~q > ~p); 47180#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47181#partsENTRY ~p := #in~p;~q := #in~q; 47185#L20 assume ~p <= 0;#res := 1; 47183#partsFINAL assume true; 47179#partsEXIT >#63#return; 47176#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47177#partsENTRY ~p := #in~p;~q := #in~q; 47184#L20 assume !(~p <= 0); 47182#L21 assume ~q <= 0;#res := 0; 47178#partsFINAL assume true; 47175#partsEXIT >#65#return; 47174#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47173#partsFINAL assume true; 47107#partsEXIT >#67#return; 47105#L36-1 havoc main_#t~ret8; 47104#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47103#L35-3 assume !!(main_~q~0 <= main_~x~0); 46988#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47099#partsENTRY ~p := #in~p;~q := #in~q; 47098#L20 assume !(~p <= 0); 47096#L21 assume !(~q <= 0); 47094#L22 assume ~q > ~p; 47033#L22-1 call #t~ret0 := parts(~p, ~p);< 47091#partsENTRY ~p := #in~p;~q := #in~q; 47082#L20 assume !(~p <= 0); 47077#L21 assume !(~q <= 0); 47072#L22 assume !(~q > ~p); 47064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47067#partsENTRY ~p := #in~p;~q := #in~q; 47073#L20 assume ~p <= 0;#res := 1; 47068#partsFINAL assume true; 47062#partsEXIT >#63#return; 47065#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47168#partsENTRY ~p := #in~p;~q := #in~q; 47169#L20 assume !(~p <= 0); 47158#L21 assume ~q <= 0;#res := 0; 47159#partsFINAL assume true; 47266#partsEXIT >#65#return; 47265#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47032#partsFINAL assume true; 47034#partsEXIT >#61#return; 47194#L22-2 #res := #t~ret0;havoc #t~ret0; 47193#partsFINAL assume true; 46987#partsEXIT >#67#return; 46986#L36-1 [2018-11-28 12:24:46,283 INFO L796 eck$LassoCheckResult]: Loop: 46986#L36-1 havoc main_#t~ret8; 46946#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46947#L35-3 assume !(main_~q~0 <= main_~x~0); 46932#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 46933#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46928#L35-3 assume !!(main_~q~0 <= main_~x~0); 46929#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47133#partsENTRY ~p := #in~p;~q := #in~q; 47141#L20 assume !(~p <= 0); 47140#L21 assume ~q <= 0;#res := 0; 47139#partsFINAL assume true; 47132#partsEXIT >#67#return; 46963#L36-1 havoc main_#t~ret8; 46948#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46949#L35-3 assume !!(main_~q~0 <= main_~x~0); 46956#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47028#partsENTRY ~p := #in~p;~q := #in~q; 47240#L20 assume !(~p <= 0); 47241#L21 assume !(~q <= 0); 47215#L22 assume !(~q > ~p); 47207#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47209#partsENTRY ~p := #in~p;~q := #in~q; 47228#L20 assume ~p <= 0;#res := 1; 47218#partsFINAL assume true; 47213#partsEXIT >#63#return; 47202#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47205#partsENTRY ~p := #in~p;~q := #in~q; 47216#L20 assume !(~p <= 0); 47212#L21 assume ~q <= 0;#res := 0; 47210#partsFINAL assume true; 47201#partsEXIT >#65#return; 47204#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47246#partsFINAL assume true; 47244#partsEXIT >#67#return; 47106#L36-1 havoc main_#t~ret8; 47102#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47100#L35-3 assume !!(main_~q~0 <= main_~x~0); 46992#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47097#partsENTRY ~p := #in~p;~q := #in~q; 47095#L20 assume !(~p <= 0); 47093#L21 assume !(~q <= 0); 47092#L22 assume ~q > ~p; 47006#L22-1 call #t~ret0 := parts(~p, ~p);< 47088#partsENTRY ~p := #in~p;~q := #in~q; 47080#L20 assume !(~p <= 0); 47076#L21 assume !(~q <= 0); 47071#L22 assume !(~q > ~p); 47049#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47050#partsENTRY ~p := #in~p;~q := #in~q; 47058#L20 assume ~p <= 0;#res := 1; 47053#partsFINAL assume true; 47044#partsEXIT >#63#return; 46942#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47041#partsENTRY ~p := #in~p;~q := #in~q; 47166#L20 assume !(~p <= 0); 47167#L21 assume ~q <= 0;#res := 0; 46940#partsFINAL assume true; 46943#partsEXIT >#65#return; 47035#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47036#partsFINAL assume true; 47005#partsEXIT >#61#return; 47002#L22-2 #res := #t~ret0;havoc #t~ret0; 46991#partsFINAL assume true; 46993#partsEXIT >#67#return; 46986#L36-1 [2018-11-28 12:24:46,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1556014239, now seen corresponding path program 2 times [2018-11-28 12:24:46,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:46,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:24:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-11-28 12:24:46,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:46,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:46,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:24:46,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:24:46,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:46,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-28 12:24:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 12:24:46,394 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:24:46,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1022817342, now seen corresponding path program 2 times [2018-11-28 12:24:46,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:46,786 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-28 12:24:46,794 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:46,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:46,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:46,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:46,795 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:46,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:46,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:46,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:46,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-11-28 12:24:46,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:46,795 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:46,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:46,845 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:46,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:46,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:46,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:46,852 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:46,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:46,867 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:46,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:46,883 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:46,910 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:24:46,911 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:46,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:46,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:46,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:46,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:24:46,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:46,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:46,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:46,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-11-28 12:24:46,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:46,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:46,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:46,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:46,947 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:24:46,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:46,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:46,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:46,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:46,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:46,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:46,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:46,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:46,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:24:46,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:24:46,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:24:46,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:24:46,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:24:46,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:24:46,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:24:46,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:24:46,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:24:46,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:24:46,951 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:24:46,951 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:24:46,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:24:46,952 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:24:46,952 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:24:46,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-11-28 12:24:46,952 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:24:46,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:47,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:47,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-28 12:24:47,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-28 12:24:47,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 648 states and 828 transitions. cyclomatic complexity: 196 Second operand 13 states. [2018-11-28 12:24:47,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 648 states and 828 transitions. cyclomatic complexity: 196. Second operand 13 states. Result 1803 states and 2376 transitions. Complement of second has 57 states. [2018-11-28 12:24:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-28 12:24:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 12:24:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-11-28 12:24:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 82 letters. Loop has 64 letters. [2018-11-28 12:24:47,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 146 letters. Loop has 64 letters. [2018-11-28 12:24:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 74 transitions. Stem has 82 letters. Loop has 128 letters. [2018-11-28 12:24:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:24:47,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1803 states and 2376 transitions. [2018-11-28 12:24:47,385 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2018-11-28 12:24:47,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1803 states to 1478 states and 1935 transitions. [2018-11-28 12:24:47,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-28 12:24:47,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-28 12:24:47,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1478 states and 1935 transitions. [2018-11-28 12:24:47,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:47,392 INFO L705 BuchiCegarLoop]: Abstraction has 1478 states and 1935 transitions. [2018-11-28 12:24:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states and 1935 transitions. [2018-11-28 12:24:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1299. [2018-11-28 12:24:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2018-11-28 12:24:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1639 transitions. [2018-11-28 12:24:47,407 INFO L728 BuchiCegarLoop]: Abstraction has 1299 states and 1639 transitions. [2018-11-28 12:24:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:24:47,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:24:47,407 INFO L87 Difference]: Start difference. First operand 1299 states and 1639 transitions. Second operand 12 states. [2018-11-28 12:24:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:47,466 INFO L93 Difference]: Finished difference Result 1434 states and 1828 transitions. [2018-11-28 12:24:47,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:24:47,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1434 states and 1828 transitions. [2018-11-28 12:24:47,472 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2018-11-28 12:24:47,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1434 states to 1401 states and 1789 transitions. [2018-11-28 12:24:47,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2018-11-28 12:24:47,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-11-28 12:24:47,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1401 states and 1789 transitions. [2018-11-28 12:24:47,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:47,478 INFO L705 BuchiCegarLoop]: Abstraction has 1401 states and 1789 transitions. [2018-11-28 12:24:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states and 1789 transitions. [2018-11-28 12:24:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1305. [2018-11-28 12:24:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-28 12:24:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1647 transitions. [2018-11-28 12:24:47,493 INFO L728 BuchiCegarLoop]: Abstraction has 1305 states and 1647 transitions. [2018-11-28 12:24:47,493 INFO L608 BuchiCegarLoop]: Abstraction has 1305 states and 1647 transitions. [2018-11-28 12:24:47,493 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 12:24:47,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1305 states and 1647 transitions. [2018-11-28 12:24:47,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-11-28 12:24:47,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:47,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:47,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:47,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 17, 13, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:47,497 INFO L794 eck$LassoCheckResult]: Stem: 52905#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 52899#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 52900#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 52901#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 52902#L35-3 assume !!(main_~q~0 <= main_~x~0); 53579#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53580#partsENTRY ~p := #in~p;~q := #in~q; 53582#L20 assume ~p <= 0;#res := 1; 53581#partsFINAL assume true; 53578#partsEXIT >#67#return; 53576#L36-1 havoc main_#t~ret8; 53575#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53573#L35-3 assume !!(main_~q~0 <= main_~x~0); 53571#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53543#partsENTRY ~p := #in~p;~q := #in~q; 53574#L20 assume ~p <= 0;#res := 1; 53572#partsFINAL assume true; 53570#partsEXIT >#67#return; 53564#L36-1 havoc main_#t~ret8; 53547#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53546#L35-3 assume !!(main_~q~0 <= main_~x~0); 52915#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 52914#partsENTRY ~p := #in~p;~q := #in~q; 52916#L20 assume ~p <= 0;#res := 1; 53670#partsFINAL assume true; 53669#partsEXIT >#67#return; 53643#L36-1 havoc main_#t~ret8; 53642#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 52960#L35-3 assume !(main_~q~0 <= main_~x~0); 52961#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 52903#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 52904#L35-3 assume !!(main_~q~0 <= main_~x~0); 54049#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54050#partsENTRY ~p := #in~p;~q := #in~q; 54064#L20 assume !(~p <= 0); 54063#L21 assume ~q <= 0;#res := 0; 54061#partsFINAL assume true; 54048#partsEXIT >#67#return; 54041#L36-1 havoc main_#t~ret8; 54035#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 54033#L35-3 assume !!(main_~q~0 <= main_~x~0); 54030#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54031#partsENTRY ~p := #in~p;~q := #in~q; 54067#L20 assume !(~p <= 0); 54065#L21 assume !(~q <= 0); 54051#L22 assume !(~q > ~p); 54045#L23 call #t~ret1 := parts(~p - ~q, ~q);< 54047#partsENTRY ~p := #in~p;~q := #in~q; 54055#L20 assume ~p <= 0;#res := 1; 54054#partsFINAL assume true; 54044#partsEXIT >#63#return; 54038#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 54040#partsENTRY ~p := #in~p;~q := #in~q; 54053#L20 assume !(~p <= 0); 54052#L21 assume ~q <= 0;#res := 0; 54042#partsFINAL assume true; 54036#partsEXIT >#65#return; 54034#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 54032#partsFINAL assume true; 54029#partsEXIT >#67#return; 54028#L36-1 havoc main_#t~ret8; 53569#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53563#L35-3 assume !!(main_~q~0 <= main_~x~0); 52956#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 54161#partsENTRY ~p := #in~p;~q := #in~q; 52955#L20 assume !(~p <= 0); 52957#L21 assume !(~q <= 0); 53556#L22 assume ~q > ~p; 52884#L22-1 call #t~ret0 := parts(~p, ~p);< 53144#partsENTRY ~p := #in~p;~q := #in~q; 53133#L20 assume !(~p <= 0); 53127#L21 assume !(~q <= 0); 53128#L22 assume !(~q > ~p); 52987#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52999#partsENTRY ~p := #in~p;~q := #in~q; 53006#L20 assume ~p <= 0;#res := 1; 53004#partsFINAL assume true; 52986#partsEXIT >#63#return; 52945#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53141#partsENTRY ~p := #in~p;~q := #in~q; 53135#L20 assume !(~p <= 0); 52943#L21 assume ~q <= 0;#res := 0; 52946#partsFINAL assume true; 53541#partsEXIT >#65#return; 52949#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 52950#partsFINAL assume true; 52882#partsEXIT >#61#return; 52885#L22-2 #res := #t~ret0;havoc #t~ret0; 52959#partsFINAL assume true; 53408#partsEXIT >#67#return; 52965#L36-1 [2018-11-28 12:24:47,498 INFO L796 eck$LassoCheckResult]: Loop: 52965#L36-1 havoc main_#t~ret8; 52923#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 52924#L35-3 assume !(main_~q~0 <= main_~x~0); 52910#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 52911#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 53314#L35-3 assume !!(main_~q~0 <= main_~x~0); 52971#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53313#partsENTRY ~p := #in~p;~q := #in~q; 52974#L20 assume !(~p <= 0); 52973#L21 assume ~q <= 0;#res := 0; 52970#partsFINAL assume true; 52972#partsEXIT >#67#return; 53312#L36-1 havoc main_#t~ret8; 53311#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53295#L35-3 assume !!(main_~q~0 <= main_~x~0); 52933#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53277#partsENTRY ~p := #in~p;~q := #in~q; 53274#L20 assume !(~p <= 0); 53248#L21 assume !(~q <= 0); 53244#L22 assume !(~q > ~p); 53189#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53191#partsENTRY ~p := #in~p;~q := #in~q; 53208#L20 assume !(~p <= 0); 53209#L21 assume !(~q <= 0); 53329#L22 assume !(~q > ~p); 53237#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53302#partsENTRY ~p := #in~p;~q := #in~q; 53374#L20 assume ~p <= 0;#res := 1; 53373#partsFINAL assume true; 53371#partsEXIT >#63#return; 53266#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53366#partsENTRY ~p := #in~p;~q := #in~q; 53384#L20 assume !(~p <= 0); 53381#L21 assume ~q <= 0;#res := 0; 53367#partsFINAL assume true; 53364#partsEXIT >#65#return; 53325#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53355#partsFINAL assume true; 53356#partsEXIT >#63#return; 53212#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53219#partsENTRY ~p := #in~p;~q := #in~q; 53234#L20 assume !(~p <= 0); 53225#L21 assume ~q <= 0;#res := 0; 53221#partsFINAL assume true; 53211#partsEXIT >#65#return; 53218#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53568#partsFINAL assume true; 53566#partsEXIT >#67#return; 53562#L36-1 havoc main_#t~ret8; 53250#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53245#L35-3 assume !!(main_~q~0 <= main_~x~0); 52931#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53166#partsENTRY ~p := #in~p;~q := #in~q; 53354#L20 assume !(~p <= 0); 53195#L21 assume !(~q <= 0); 53193#L22 assume !(~q > ~p); 53188#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53191#partsENTRY ~p := #in~p;~q := #in~q; 53208#L20 assume ~p <= 0;#res := 1; 53207#partsFINAL assume true; 53186#partsEXIT >#63#return; 53180#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53182#partsENTRY ~p := #in~p;~q := #in~q; 53241#L20 assume !(~p <= 0); 53235#L21 assume !(~q <= 0); 53226#L22 assume !(~q > ~p); 53187#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53191#partsENTRY ~p := #in~p;~q := #in~q; 53208#L20 assume !(~p <= 0); 53209#L21 assume !(~q <= 0); 53329#L22 assume !(~q > ~p); 53237#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53302#partsENTRY ~p := #in~p;~q := #in~q; 53374#L20 assume ~p <= 0;#res := 1; 53373#partsFINAL assume true; 53371#partsEXIT >#63#return; 53266#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53366#partsENTRY ~p := #in~p;~q := #in~q; 53384#L20 assume !(~p <= 0); 53381#L21 assume ~q <= 0;#res := 0; 53367#partsFINAL assume true; 53364#partsEXIT >#65#return; 53325#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53355#partsFINAL assume true; 53356#partsEXIT >#63#return; 53214#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53219#partsENTRY ~p := #in~p;~q := #in~q; 53234#L20 assume !(~p <= 0); 53225#L21 assume ~q <= 0;#res := 0; 53221#partsFINAL assume true; 53211#partsEXIT >#65#return; 53205#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53185#partsFINAL assume true; 53178#partsEXIT >#65#return; 53175#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53172#partsFINAL assume true; 53170#partsEXIT >#67#return; 53169#L36-1 havoc main_#t~ret8; 53168#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 53167#L35-3 assume !!(main_~q~0 <= main_~x~0); 52935#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 53146#partsENTRY ~p := #in~p;~q := #in~q; 53147#L20 assume !(~p <= 0); 53427#L21 assume !(~q <= 0); 53422#L22 assume ~q > ~p; 53034#L22-1 call #t~ret0 := parts(~p, ~p);< 53419#partsENTRY ~p := #in~p;~q := #in~q; 53449#L20 assume !(~p <= 0); 53448#L21 assume !(~q <= 0); 53447#L22 assume !(~q > ~p); 52994#L23 call #t~ret1 := parts(~p - ~q, ~q);< 53003#partsENTRY ~p := #in~p;~q := #in~q; 53051#L20 assume ~p <= 0;#res := 1; 53032#partsFINAL assume true; 52990#partsEXIT >#63#return; 52996#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 53434#partsENTRY ~p := #in~p;~q := #in~q; 53453#L20 assume !(~p <= 0); 53452#L21 assume ~q <= 0;#res := 0; 53443#partsFINAL assume true; 53431#partsEXIT >#65#return; 53424#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 53420#partsFINAL assume true; 53417#partsEXIT >#61#return; 53415#L22-2 #res := #t~ret0;havoc #t~ret0; 53413#partsFINAL assume true; 53406#partsEXIT >#67#return; 52965#L36-1 [2018-11-28 12:24:47,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash 489369963, now seen corresponding path program 3 times [2018-11-28 12:24:47,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:47,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:47,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:47,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash 941825510, now seen corresponding path program 3 times [2018-11-28 12:24:47,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:47,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:24:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 185 proven. 144 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-11-28 12:24:47,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:24:47,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:24:47,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:24:47,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 12:24:47,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:24:47,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:24:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 175 proven. 161 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-28 12:24:47,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:24:47,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 16 [2018-11-28 12:24:47,742 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:24:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 12:24:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-28 12:24:47,743 INFO L87 Difference]: Start difference. First operand 1305 states and 1647 transitions. cyclomatic complexity: 372 Second operand 17 states. [2018-11-28 12:24:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:24:48,144 INFO L93 Difference]: Finished difference Result 1311 states and 1621 transitions. [2018-11-28 12:24:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 12:24:48,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1311 states and 1621 transitions. [2018-11-28 12:24:48,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-28 12:24:48,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1311 states to 914 states and 1112 transitions. [2018-11-28 12:24:48,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-28 12:24:48,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-28 12:24:48,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1112 transitions. [2018-11-28 12:24:48,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:24:48,151 INFO L705 BuchiCegarLoop]: Abstraction has 914 states and 1112 transitions. [2018-11-28 12:24:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1112 transitions. [2018-11-28 12:24:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 686. [2018-11-28 12:24:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-28 12:24:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 816 transitions. [2018-11-28 12:24:48,160 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 816 transitions. [2018-11-28 12:24:48,160 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 816 transitions. [2018-11-28 12:24:48,160 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 12:24:48,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 816 transitions. [2018-11-28 12:24:48,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-28 12:24:48,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:24:48,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:24:48,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 8, 8, 8, 7, 7, 7, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:24:48,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:24:48,163 INFO L794 eck$LassoCheckResult]: Stem: 55945#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 55935#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 55936#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 55937#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 55938#L35-3 assume !!(main_~q~0 <= main_~x~0); 56045#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56046#partsENTRY ~p := #in~p;~q := #in~q; 56048#L20 assume ~p <= 0;#res := 1; 56047#partsFINAL assume true; 56044#partsEXIT >#67#return; 56043#L36-1 havoc main_#t~ret8; 56042#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56040#L35-3 assume !!(main_~q~0 <= main_~x~0); 56038#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56033#partsENTRY ~p := #in~p;~q := #in~q; 56041#L20 assume ~p <= 0;#res := 1; 56039#partsFINAL assume true; 56037#partsEXIT >#67#return; 56036#L36-1 havoc main_#t~ret8; 56035#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56034#L35-3 assume !!(main_~q~0 <= main_~x~0); 56029#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56032#partsENTRY ~p := #in~p;~q := #in~q; 56028#L20 assume ~p <= 0;#res := 1; 56030#partsFINAL assume true; 56049#partsEXIT >#67#return; 56050#L36-1 havoc main_#t~ret8; 56264#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56263#L35-3 assume !(main_~q~0 <= main_~x~0); 56262#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 56261#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 56165#L35-3 assume !!(main_~q~0 <= main_~x~0); 56163#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56171#partsENTRY ~p := #in~p;~q := #in~q; 56172#L20 assume !(~p <= 0); 56260#L21 assume ~q <= 0;#res := 0; 56162#partsFINAL assume true; 56164#partsEXIT >#67#return; 56154#L36-1 havoc main_#t~ret8; 56155#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56146#L35-3 assume !!(main_~q~0 <= main_~x~0); 56147#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 56193#partsENTRY ~p := #in~p;~q := #in~q; 56194#L20 assume !(~p <= 0); 56189#L21 assume !(~q <= 0); 56190#L22 assume !(~q > ~p); 56181#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56182#partsENTRY ~p := #in~p;~q := #in~q; 56188#L20 assume ~p <= 0;#res := 1; 56184#partsFINAL assume true; 56180#partsEXIT >#63#return; 56177#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 56178#partsENTRY ~p := #in~p;~q := #in~q; 56187#L20 assume !(~p <= 0); 56183#L21 assume ~q <= 0;#res := 0; 56179#partsFINAL assume true; 56176#partsEXIT >#65#return; 56175#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 56173#partsFINAL assume true; 56174#partsEXIT >#67#return; 56238#L36-1 havoc main_#t~ret8; 56237#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56236#L35-3 assume !!(main_~q~0 <= main_~x~0); 55996#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 55997#partsENTRY ~p := #in~p;~q := #in~q; 56025#L20 assume !(~p <= 0); 56022#L21 assume !(~q <= 0); 56016#L22 assume ~q > ~p; 56017#L22-1 call #t~ret0 := parts(~p, ~p);< 56228#partsENTRY ~p := #in~p;~q := #in~q; 56222#L20 assume !(~p <= 0); 56219#L21 assume !(~q <= 0); 56214#L22 assume !(~q > ~p); 56203#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56210#partsENTRY ~p := #in~p;~q := #in~q; 56216#L20 assume ~p <= 0;#res := 1; 56212#partsFINAL assume true; 56201#partsEXIT >#63#return; 56199#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 56200#partsENTRY ~p := #in~p;~q := #in~q; 56443#L20 assume !(~p <= 0); 56442#L21 assume ~q <= 0;#res := 0; 56441#partsFINAL assume true; 56197#partsEXIT >#65#return; 56195#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 56196#partsFINAL assume true; 56233#partsEXIT >#61#return; 56008#L22-2 #res := #t~ret0;havoc #t~ret0; 55999#partsFINAL assume true; 56000#partsEXIT >#67#return; 55992#L36-1 havoc main_#t~ret8; 55955#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 55941#L35-3 assume !(main_~q~0 <= main_~x~0); 55942#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 55946#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 55993#L35-3 assume !!(main_~q~0 <= main_~x~0); 55988#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 55989#partsENTRY ~p := #in~p;~q := #in~q; 56006#L20 assume !(~p <= 0); 56005#L21 assume ~q <= 0;#res := 0; 56004#partsFINAL assume true; 56003#partsEXIT >#67#return; 55968#L36-1 havoc main_#t~ret8; 55969#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 56488#L35-3 assume !!(main_~q~0 <= main_~x~0); 55959#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 55991#partsENTRY ~p := #in~p;~q := #in~q; 56293#L20 assume !(~p <= 0); 56284#L21 assume !(~q <= 0); 56285#L22 [2018-11-28 12:24:48,163 INFO L796 eck$LassoCheckResult]: Loop: 56285#L22 assume !(~q > ~p); 55933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 56606#partsENTRY ~p := #in~p;~q := #in~q; 56605#L20 assume !(~p <= 0); 56603#L21 assume !(~q <= 0); 56285#L22 [2018-11-28 12:24:48,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1102315101, now seen corresponding path program 4 times [2018-11-28 12:24:48,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:48,180 INFO L82 PathProgramCache]: Analyzing trace with hash 43405619, now seen corresponding path program 3 times [2018-11-28 12:24:48,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:48,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:48,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:24:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash -458298281, now seen corresponding path program 5 times [2018-11-28 12:24:48,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:24:48,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:24:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:24:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:24:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:24:48,260 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:24:48,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:24:48,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:24:48,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:24:48,261 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:24:48,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:24:48,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:24:48,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-11-28 12:24:48,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:24:48,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:24:48,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:48,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:48,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:48,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:48,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:24:48,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:24:48,311 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:48,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:48,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:48,325 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:48,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:48,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:48,347 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:48,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:48,366 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:48,366 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:48,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:24:48,386 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:24:48,386 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:24:48,404 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:24:48,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:24:48,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:00,452 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 12:25:00,453 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:00,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:00,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:00,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:00,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:00,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:00,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:00,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:00,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-11-28 12:25:00,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:00,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:00,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:00,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:00,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:00,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:00,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:00,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:00,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:00,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:00,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:00,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:00,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:00,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:00,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:00,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:00,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:00,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:00,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:00,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:00,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:00,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:00,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:00,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:00,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:00,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:00,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:00,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:00,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:00,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:00,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:00,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:00,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:00,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:00,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:00,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:00,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:00,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:00,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:00,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:00,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:00,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:00,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:00,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:00,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:00,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:00,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:00,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:00,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:00,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:00,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:00,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:00,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:00,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:00,519 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:25:00,519 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:25:00,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:00,520 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:25:00,520 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:00,520 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-28 12:25:00,520 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:25:00,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:00,698 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:25:00,698 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-11-28 12:25:00,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 692 states and 822 transitions. Complement of second has 10 states. [2018-11-28 12:25:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:25:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-28 12:25:00,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 109 letters. Loop has 5 letters. [2018-11-28 12:25:00,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:00,736 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:00,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:00,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:25:00,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-11-28 12:25:00,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 692 states and 822 transitions. Complement of second has 10 states. [2018-11-28 12:25:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:25:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-28 12:25:00,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 109 letters. Loop has 5 letters. [2018-11-28 12:25:00,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:00,888 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:00,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:00,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:00,970 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 12:25:00,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149 Second operand 7 states. [2018-11-28 12:25:01,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 686 states and 816 transitions. cyclomatic complexity: 149. Second operand 7 states. Result 887 states and 1046 transitions. Complement of second has 20 states. [2018-11-28 12:25:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:25:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-28 12:25:01,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 109 letters. Loop has 5 letters. [2018-11-28 12:25:01,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:01,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 114 letters. Loop has 5 letters. [2018-11-28 12:25:01,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:01,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 109 letters. Loop has 10 letters. [2018-11-28 12:25:01,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:01,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1046 transitions. [2018-11-28 12:25:01,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-28 12:25:01,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 732 states and 870 transitions. [2018-11-28 12:25:01,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-28 12:25:01,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-28 12:25:01,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 732 states and 870 transitions. [2018-11-28 12:25:01,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:01,030 INFO L705 BuchiCegarLoop]: Abstraction has 732 states and 870 transitions. [2018-11-28 12:25:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states and 870 transitions. [2018-11-28 12:25:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 704. [2018-11-28 12:25:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-28 12:25:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 837 transitions. [2018-11-28 12:25:01,037 INFO L728 BuchiCegarLoop]: Abstraction has 704 states and 837 transitions. [2018-11-28 12:25:01,037 INFO L608 BuchiCegarLoop]: Abstraction has 704 states and 837 transitions. [2018-11-28 12:25:01,037 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 12:25:01,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 704 states and 837 transitions. [2018-11-28 12:25:01,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 12:25:01,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:01,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:01,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 8, 8, 8, 7, 7, 7, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:01,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 12:25:01,038 INFO L794 eck$LassoCheckResult]: Stem: 60022#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 60012#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 60013#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 60014#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60015#L35-3 assume !!(main_~q~0 <= main_~x~0); 60222#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60223#partsENTRY ~p := #in~p;~q := #in~q; 60225#L20 assume ~p <= 0;#res := 1; 60224#partsFINAL assume true; 60221#partsEXIT >#67#return; 60220#L36-1 havoc main_#t~ret8; 60219#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60218#L35-3 assume !!(main_~q~0 <= main_~x~0); 60169#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60134#partsENTRY ~p := #in~p;~q := #in~q; 60176#L20 assume ~p <= 0;#res := 1; 60175#partsFINAL assume true; 60168#partsEXIT >#67#return; 60125#L36-1 havoc main_#t~ret8; 60126#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60120#L35-3 assume !!(main_~q~0 <= main_~x~0); 60114#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60130#partsENTRY ~p := #in~p;~q := #in~q; 60127#L20 assume ~p <= 0;#res := 1; 60123#partsFINAL assume true; 60113#partsEXIT >#67#return; 60111#L36-1 havoc main_#t~ret8; 60106#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60100#L35-3 assume !(main_~q~0 <= main_~x~0); 60024#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 60025#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60306#L35-3 assume !!(main_~q~0 <= main_~x~0); 60245#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60246#partsENTRY ~p := #in~p;~q := #in~q; 60261#L20 assume !(~p <= 0); 60259#L21 assume ~q <= 0;#res := 0; 60256#partsFINAL assume true; 60244#partsEXIT >#67#return; 60239#L36-1 havoc main_#t~ret8; 60235#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60232#L35-3 assume !!(main_~q~0 <= main_~x~0); 60233#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60300#partsENTRY ~p := #in~p;~q := #in~q; 60333#L20 assume !(~p <= 0); 60332#L21 assume !(~q <= 0); 60330#L22 assume !(~q > ~p); 60254#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60260#partsENTRY ~p := #in~p;~q := #in~q; 60258#L20 assume ~p <= 0;#res := 1; 60253#partsFINAL assume true; 60255#partsEXIT >#63#return; 60328#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60329#partsENTRY ~p := #in~p;~q := #in~q; 60347#L20 assume !(~p <= 0); 60345#L21 assume ~q <= 0;#res := 0; 60343#partsFINAL assume true; 60327#partsEXIT >#65#return; 60325#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 60319#partsFINAL assume true; 60299#partsEXIT >#67#return; 60298#L36-1 havoc main_#t~ret8; 60296#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60295#L35-3 assume !!(main_~q~0 <= main_~x~0); 60084#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60085#partsENTRY ~p := #in~p;~q := #in~q; 60440#L20 assume !(~p <= 0); 60439#L21 assume !(~q <= 0); 60262#L22 assume ~q > ~p; 60005#L22-1 call #t~ret0 := parts(~p, ~p);< 60110#partsENTRY ~p := #in~p;~q := #in~q; 60293#L20 assume !(~p <= 0); 60294#L21 assume !(~q <= 0); 60428#L22 assume !(~q > ~p); 60004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60006#partsENTRY ~p := #in~p;~q := #in~q; 60290#L20 assume ~p <= 0;#res := 1; 60289#partsFINAL assume true; 60285#partsEXIT >#63#return; 60277#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60279#partsENTRY ~p := #in~p;~q := #in~q; 60287#L20 assume !(~p <= 0); 60286#L21 assume ~q <= 0;#res := 0; 60284#partsFINAL assume true; 60275#partsEXIT >#65#return; 60272#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 60263#partsFINAL assume true; 60107#partsEXIT >#61#return; 60088#L22-2 #res := #t~ret0;havoc #t~ret0; 60087#partsFINAL assume true; 60083#partsEXIT >#67#return; 60081#L36-1 havoc main_#t~ret8; 60039#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60018#L35-3 assume !(main_~q~0 <= main_~x~0); 60019#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 60023#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 60082#L35-3 assume !!(main_~q~0 <= main_~x~0); 60070#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60071#partsENTRY ~p := #in~p;~q := #in~q; 60104#L20 assume !(~p <= 0); 60103#L21 assume ~q <= 0;#res := 0; 60102#partsFINAL assume true; 60101#partsEXIT >#67#return; 60064#L36-1 havoc main_#t~ret8; 60065#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 60600#L35-3 assume !!(main_~q~0 <= main_~x~0); 60028#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 60026#partsENTRY ~p := #in~p;~q := #in~q; 60029#L20 assume !(~p <= 0); 60447#L21 assume !(~q <= 0); 60053#L22 [2018-11-28 12:25:01,038 INFO L796 eck$LassoCheckResult]: Loop: 60053#L22 assume !(~q > ~p); 60060#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60541#partsENTRY ~p := #in~p;~q := #in~q; 60539#L20 assume !(~p <= 0); 60540#L21 assume !(~q <= 0); 60538#L22 assume !(~q > ~p); 60534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 60535#partsENTRY ~p := #in~p;~q := #in~q; 60537#L20 assume ~p <= 0;#res := 1; 60536#partsFINAL assume true; 60533#partsEXIT >#63#return; 60052#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 60532#partsENTRY ~p := #in~p;~q := #in~q; 60530#L20 assume !(~p <= 0); 60051#L21 assume !(~q <= 0); 60053#L22 [2018-11-28 12:25:01,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1102315101, now seen corresponding path program 6 times [2018-11-28 12:25:01,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:01,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:01,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1254788439, now seen corresponding path program 2 times [2018-11-28 12:25:01,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:01,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:01,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -683242629, now seen corresponding path program 7 times [2018-11-28 12:25:01,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 110 proven. 99 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-28 12:25:01,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:01,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:01,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-11-28 12:25:01,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:01,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2018-11-28 12:25:01,491 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:01,491 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:01,491 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:01,491 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:01,491 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:25:01,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:01,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:01,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:01,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-11-28 12:25:01,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:01,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:01,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:01,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:01,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-28 12:25:01,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:01,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:01,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:01,544 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:01,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:01,552 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:01,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:25:01,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:03,971 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:25:03,972 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:03,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:03,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:03,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:03,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:03,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:03,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:03,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:03,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-11-28 12:25:03,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:03,973 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:03,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:03,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:03,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-28 12:25:03,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:03,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-28 12:25:04,009 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:04,009 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:04,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:04,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:04,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:04,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:04,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:04,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:04,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:04,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:04,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:04,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:04,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:04,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:04,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:04,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:04,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:04,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:04,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:04,013 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:04,016 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:25:04,016 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:25:04,016 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:04,016 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:25:04,016 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:04,016 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-11-28 12:25:04,017 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:25:04,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:04,181 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:25:04,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-11-28 12:25:04,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 718 states and 851 transitions. Complement of second has 14 states. [2018-11-28 12:25:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:25:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-28 12:25:04,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 109 letters. Loop has 15 letters. [2018-11-28 12:25:04,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:04,279 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:04,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:04,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:25:04,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-11-28 12:25:04,453 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 718 states and 851 transitions. Complement of second has 14 states. [2018-11-28 12:25:04,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:25:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-28 12:25:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 109 letters. Loop has 15 letters. [2018-11-28 12:25:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:04,454 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:04,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:04,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:04,570 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-28 12:25:04,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152 Second operand 8 states. [2018-11-28 12:25:04,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 704 states and 837 transitions. cyclomatic complexity: 152. Second operand 8 states. Result 1998 states and 2359 transitions. Complement of second has 160 states. [2018-11-28 12:25:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 12:25:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2018-11-28 12:25:04,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 109 letters. Loop has 15 letters. [2018-11-28 12:25:04,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:04,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 124 letters. Loop has 15 letters. [2018-11-28 12:25:04,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:04,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 109 letters. Loop has 30 letters. [2018-11-28 12:25:04,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:04,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1998 states and 2359 transitions. [2018-11-28 12:25:04,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-11-28 12:25:04,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1998 states to 982 states and 1184 transitions. [2018-11-28 12:25:04,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-28 12:25:04,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2018-11-28 12:25:04,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 982 states and 1184 transitions. [2018-11-28 12:25:04,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:04,729 INFO L705 BuchiCegarLoop]: Abstraction has 982 states and 1184 transitions. [2018-11-28 12:25:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states and 1184 transitions. [2018-11-28 12:25:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 609. [2018-11-28 12:25:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-28 12:25:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 732 transitions. [2018-11-28 12:25:04,744 INFO L728 BuchiCegarLoop]: Abstraction has 609 states and 732 transitions. [2018-11-28 12:25:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:25:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:25:04,745 INFO L87 Difference]: Start difference. First operand 609 states and 732 transitions. Second operand 16 states. [2018-11-28 12:25:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:05,175 INFO L93 Difference]: Finished difference Result 1431 states and 1648 transitions. [2018-11-28 12:25:05,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 12:25:05,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1431 states and 1648 transitions. [2018-11-28 12:25:05,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-28 12:25:05,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1431 states to 1014 states and 1177 transitions. [2018-11-28 12:25:05,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-28 12:25:05,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-11-28 12:25:05,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1014 states and 1177 transitions. [2018-11-28 12:25:05,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:05,182 INFO L705 BuchiCegarLoop]: Abstraction has 1014 states and 1177 transitions. [2018-11-28 12:25:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states and 1177 transitions. [2018-11-28 12:25:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 801. [2018-11-28 12:25:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-28 12:25:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 937 transitions. [2018-11-28 12:25:05,191 INFO L728 BuchiCegarLoop]: Abstraction has 801 states and 937 transitions. [2018-11-28 12:25:05,191 INFO L608 BuchiCegarLoop]: Abstraction has 801 states and 937 transitions. [2018-11-28 12:25:05,191 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 12:25:05,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 937 transitions. [2018-11-28 12:25:05,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-28 12:25:05,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:05,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:05,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [27, 25, 19, 12, 12, 11, 11, 11, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-28 12:25:05,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:05,194 INFO L794 eck$LassoCheckResult]: Stem: 67998#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 67986#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 67987#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 67988#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 67989#L35-3 assume !!(main_~q~0 <= main_~x~0); 68209#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68210#partsENTRY ~p := #in~p;~q := #in~q; 68213#L20 assume ~p <= 0;#res := 1; 68211#partsFINAL assume true; 68208#partsEXIT >#67#return; 68207#L36-1 havoc main_#t~ret8; 68204#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68200#L35-3 assume !!(main_~q~0 <= main_~x~0); 68197#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68199#partsENTRY ~p := #in~p;~q := #in~q; 68205#L20 assume ~p <= 0;#res := 1; 68202#partsFINAL assume true; 68196#partsEXIT >#67#return; 68146#L36-1 havoc main_#t~ret8; 68137#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68134#L35-3 assume !!(main_~q~0 <= main_~x~0); 68000#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 67999#partsENTRY ~p := #in~p;~q := #in~q; 68001#L20 assume ~p <= 0;#res := 1; 68533#partsFINAL assume true; 68532#partsEXIT >#67#return; 68531#L36-1 havoc main_#t~ret8; 68530#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68529#L35-3 assume !(main_~q~0 <= main_~x~0); 68528#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 68526#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 68524#L35-3 assume !!(main_~q~0 <= main_~x~0); 68521#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68522#partsENTRY ~p := #in~p;~q := #in~q; 68527#L20 assume !(~p <= 0); 68525#L21 assume ~q <= 0;#res := 0; 68523#partsFINAL assume true; 68520#partsEXIT >#67#return; 68519#L36-1 havoc main_#t~ret8; 68518#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68517#L35-3 assume !!(main_~q~0 <= main_~x~0); 68512#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68516#partsENTRY ~p := #in~p;~q := #in~q; 68515#L20 assume !(~p <= 0); 68514#L21 assume !(~q <= 0); 68513#L22 assume !(~q > ~p); 68510#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68506#partsENTRY ~p := #in~p;~q := #in~q; 68612#L20 assume ~p <= 0;#res := 1; 68509#partsFINAL assume true; 68511#partsEXIT >#63#return; 68606#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68607#partsENTRY ~p := #in~p;~q := #in~q; 68611#L20 assume !(~p <= 0); 68609#L21 assume ~q <= 0;#res := 0; 68608#partsFINAL assume true; 68605#partsEXIT >#65#return; 68604#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68603#partsFINAL assume true; 68601#partsEXIT >#67#return; 68602#L36-1 havoc main_#t~ret8; 68628#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68626#L35-3 assume !!(main_~q~0 <= main_~x~0); 68622#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68623#partsENTRY ~p := #in~p;~q := #in~q; 68642#L20 assume !(~p <= 0); 68636#L21 assume !(~q <= 0); 68633#L22 assume ~q > ~p; 68630#L22-1 call #t~ret0 := parts(~p, ~p);< 68631#partsENTRY ~p := #in~p;~q := #in~q; 68657#L20 assume !(~p <= 0); 68658#L21 assume !(~q <= 0); 68662#L22 assume !(~q > ~p); 68654#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68655#partsENTRY ~p := #in~p;~q := #in~q; 68665#L20 assume ~p <= 0;#res := 1; 68663#partsFINAL assume true; 68652#partsEXIT >#63#return; 68650#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68651#partsENTRY ~p := #in~p;~q := #in~q; 68661#L20 assume !(~p <= 0); 68660#L21 assume ~q <= 0;#res := 0; 68659#partsFINAL assume true; 68648#partsEXIT >#65#return; 68634#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68632#partsFINAL assume true; 68629#partsEXIT >#61#return; 68627#L22-2 #res := #t~ret0;havoc #t~ret0; 68625#partsFINAL assume true; 68621#partsEXIT >#67#return; 68620#L36-1 havoc main_#t~ret8; 68618#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68616#L35-3 assume !(main_~q~0 <= main_~x~0); 67997#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 67990#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 67991#L35-3 assume !!(main_~q~0 <= main_~x~0); 68545#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68547#partsENTRY ~p := #in~p;~q := #in~q; 68554#L20 assume !(~p <= 0); 68552#L21 assume ~q <= 0;#res := 0; 68553#partsFINAL assume true; 68544#partsEXIT >#67#return; 68546#L36-1 havoc main_#t~ret8; 68490#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68491#L35-3 assume !!(main_~q~0 <= main_~x~0); 68479#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68482#partsENTRY ~p := #in~p;~q := #in~q; 68538#L20 assume !(~p <= 0); 68539#L21 assume !(~q <= 0); 68610#L22 assume !(~q > ~p); 68505#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68506#partsENTRY ~p := #in~p;~q := #in~q; 68612#L20 assume ~p <= 0;#res := 1; 68509#partsFINAL assume true; 68511#partsEXIT >#63#return; 68501#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68764#partsENTRY ~p := #in~p;~q := #in~q; 68766#L20 assume !(~p <= 0); 68765#L21 assume ~q <= 0;#res := 0; 68500#partsFINAL assume true; 68502#partsEXIT >#65#return; 68763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68762#partsFINAL assume true; 68478#partsEXIT >#67#return; 68480#L36-1 havoc main_#t~ret8; 68055#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68053#L35-3 assume !!(main_~q~0 <= main_~x~0); 68049#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68050#partsENTRY ~p := #in~p;~q := #in~q; 68061#L20 assume !(~p <= 0); 68060#L21 assume !(~q <= 0); 68059#L22 assume ~q > ~p; 68057#L22-1 call #t~ret0 := parts(~p, ~p);< 68058#partsENTRY ~p := #in~p;~q := #in~q; 68080#L20 assume !(~p <= 0); 68077#L21 assume !(~q <= 0); 68074#L22 assume !(~q > ~p); 68071#L23 call #t~ret1 := parts(~p - ~q, ~q);< 67983#partsENTRY ~p := #in~p;~q := #in~q; 68076#L20 assume ~p <= 0;#res := 1; 68073#partsFINAL assume true; 68070#partsEXIT >#63#return; 68067#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68068#partsENTRY ~p := #in~p;~q := #in~q; 68086#L20 assume !(~p <= 0); 68084#L21 assume ~q <= 0;#res := 0; 68083#partsFINAL assume true; 68065#partsEXIT >#65#return; 68063#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68062#partsFINAL assume true; 68056#partsEXIT >#61#return; 68054#L22-2 #res := #t~ret0;havoc #t~ret0; 68052#partsFINAL assume true; 68048#partsEXIT >#67#return; 68043#L36-1 havoc main_#t~ret8; 68009#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 67992#L35-3 assume !(main_~q~0 <= main_~x~0); 67993#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 67996#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 68042#L35-3 assume !!(main_~q~0 <= main_~x~0); 68036#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68037#partsENTRY ~p := #in~p;~q := #in~q; 68047#L20 assume !(~p <= 0); 68046#L21 assume ~q <= 0;#res := 0; 68045#partsFINAL assume true; 68044#partsEXIT >#67#return; 68020#L36-1 havoc main_#t~ret8; 68021#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68231#L35-3 assume !!(main_~q~0 <= main_~x~0); 68227#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68228#partsENTRY ~p := #in~p;~q := #in~q; 68252#L20 assume !(~p <= 0); 68246#L21 assume !(~q <= 0); 68243#L22 assume !(~q > ~p); 68239#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68240#partsENTRY ~p := #in~p;~q := #in~q; 68271#L20 assume !(~p <= 0); 68269#L21 assume !(~q <= 0); 68268#L22 assume !(~q > ~p); 68257#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68259#partsENTRY ~p := #in~p;~q := #in~q; 68272#L20 assume ~p <= 0;#res := 1; 68270#partsFINAL assume true; 68256#partsEXIT >#63#return; 68249#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68251#partsENTRY ~p := #in~p;~q := #in~q; 68261#L20 assume !(~p <= 0); 68260#L21 assume ~q <= 0;#res := 0; 68253#partsFINAL assume true; 68247#partsEXIT >#65#return; 68245#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68242#partsFINAL assume true; 68238#partsEXIT >#63#return; 68235#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68236#partsENTRY ~p := #in~p;~q := #in~q; 68244#L20 assume !(~p <= 0); 68241#L21 assume ~q <= 0;#res := 0; 68237#partsFINAL assume true; 68234#partsEXIT >#65#return; 68233#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 68230#partsFINAL assume true; 68226#partsEXIT >#67#return; 68215#L36-1 havoc main_#t~ret8; 68147#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 68128#L35-3 assume !!(main_~q~0 <= main_~x~0); 68015#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 68105#partsENTRY ~p := #in~p;~q := #in~q; 68101#L20 assume !(~p <= 0); 68102#L21 assume !(~q <= 0); 68296#L22 assume ~q > ~p; 68290#L22-1 call #t~ret0 := parts(~p, ~p);< 68289#partsENTRY ~p := #in~p;~q := #in~q; 68291#L20 assume !(~p <= 0); 68299#L21 [2018-11-28 12:25:05,194 INFO L796 eck$LassoCheckResult]: Loop: 68299#L21 assume !(~q <= 0); 68298#L22 assume !(~q > ~p); 68294#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68295#partsENTRY ~p := #in~p;~q := #in~q; 68303#L20 assume ~p <= 0;#res := 1; 68297#partsFINAL assume true; 68293#partsEXIT >#63#return; 68024#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 68292#partsENTRY ~p := #in~p;~q := #in~q; 68287#L20 assume !(~p <= 0); 68023#L21 assume !(~q <= 0); 68025#L22 assume !(~q > ~p); 68012#L23 call #t~ret1 := parts(~p - ~q, ~q);< 68302#partsENTRY ~p := #in~p;~q := #in~q; 68300#L20 assume !(~p <= 0); 68102#L21 assume !(~q <= 0); 68296#L22 assume ~q > ~p; 68290#L22-1 call #t~ret0 := parts(~p, ~p);< 68289#partsENTRY ~p := #in~p;~q := #in~q; 68291#L20 assume !(~p <= 0); 68299#L21 [2018-11-28 12:25:05,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1575512057, now seen corresponding path program 8 times [2018-11-28 12:25:05,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:05,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:05,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 275 proven. 104 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2018-11-28 12:25:05,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:25:05,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:25:05,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:25:05,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:25:05,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:25:05,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 1111 proven. 10 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-11-28 12:25:05,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:25:05,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-28 12:25:05,461 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:05,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:05,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1841932034, now seen corresponding path program 2 times [2018-11-28 12:25:05,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:05,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:05,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:05,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:05,653 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:05,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:05,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:05,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:05,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:25:05,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:05,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:05,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:05,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-11-28 12:25:05,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:05,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:05,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:05,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-28 12:25:05,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:05,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:05,694 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:05,694 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:05,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:05,698 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ba152ae-9631-4c01-83d8-c3a249192829/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:05,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:25:05,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:08,415 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:25:08,417 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:08,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:08,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:08,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:08,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:08,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:08,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:08,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:08,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-11-28 12:25:08,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:08,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:08,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:08,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:08,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:08,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:08,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:08,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:08,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:08,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:08,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:08,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:08,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:08,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:08,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:08,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:08,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:08,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:08,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:08,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:08,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:08,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:08,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:08,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:25:08,473 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:25:08,473 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:08,473 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:25:08,474 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:08,474 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-11-28 12:25:08,474 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:25:08,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:08,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-28 12:25:08,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-11-28 12:25:08,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 803 states and 939 transitions. Complement of second has 6 states. [2018-11-28 12:25:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:25:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:25:08,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 213 letters. Loop has 20 letters. [2018-11-28 12:25:08,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:08,748 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:08,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:08,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:08,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-28 12:25:08,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-11-28 12:25:08,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 803 states and 939 transitions. Complement of second has 6 states. [2018-11-28 12:25:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:25:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 12:25:08,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 213 letters. Loop has 20 letters. [2018-11-28 12:25:08,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:08,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:08,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:09,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-28 12:25:09,151 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-11-28 12:25:09,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 1880 states and 2091 transitions. Complement of second has 64 states. [2018-11-28 12:25:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:25:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-28 12:25:09,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 213 letters. Loop has 20 letters. [2018-11-28 12:25:09,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:09,312 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:25:09,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:09,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 12:25:09,517 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-28 12:25:09,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155 Second operand 11 states. [2018-11-28 12:25:09,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 801 states and 937 transitions. cyclomatic complexity: 155. Second operand 11 states. Result 3287 states and 3823 transitions. Complement of second has 214 states. [2018-11-28 12:25:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 12:25:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 12:25:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-11-28 12:25:09,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 213 letters. Loop has 20 letters. [2018-11-28 12:25:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 233 letters. Loop has 20 letters. [2018-11-28 12:25:09,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 75 transitions. Stem has 213 letters. Loop has 40 letters. [2018-11-28 12:25:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:09,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3287 states and 3823 transitions. [2018-11-28 12:25:09,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-28 12:25:09,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3287 states to 999 states and 1173 transitions. [2018-11-28 12:25:09,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-28 12:25:09,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-28 12:25:09,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 999 states and 1173 transitions. [2018-11-28 12:25:09,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:09,775 INFO L705 BuchiCegarLoop]: Abstraction has 999 states and 1173 transitions. [2018-11-28 12:25:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states and 1173 transitions. [2018-11-28 12:25:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2018-11-28 12:25:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-11-28 12:25:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 918 transitions. [2018-11-28 12:25:09,786 INFO L728 BuchiCegarLoop]: Abstraction has 781 states and 918 transitions. [2018-11-28 12:25:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:25:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:25:09,786 INFO L87 Difference]: Start difference. First operand 781 states and 918 transitions. Second operand 19 states. [2018-11-28 12:25:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:10,133 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2018-11-28 12:25:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 12:25:10,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 276 transitions. [2018-11-28 12:25:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:25:10,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:25:10,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:25:10,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:10,134 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 12:25:10,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:25:10,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:25:10,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:25:10,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:25:10 BoogieIcfgContainer [2018-11-28 12:25:10,141 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:25:10,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:25:10,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:25:10,141 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:25:10,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:34" (3/4) ... [2018-11-28 12:25:10,144 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:25:10,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:25:10,145 INFO L168 Benchmark]: Toolchain (without parser) took 36503.59 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.5 MB). Free memory was 958.7 MB in the beginning and 1.5 GB in the end (delta: -535.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,145 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.58 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,146 INFO L168 Benchmark]: Boogie Preprocessor took 47.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -124.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,147 INFO L168 Benchmark]: RCFGBuilder took 150.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,147 INFO L168 Benchmark]: BuchiAutomizer took 36133.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 451.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -438.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:10,147 INFO L168 Benchmark]: Witness Printer took 3.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:10,151 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.58 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.0 GB. Free memory is still 947.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -124.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 150.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 36133.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 451.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -438.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. 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 33 terminating modules (20 trivial, 7 deterministic, 6 nondeterministic). One deterministic module has affine ranking function -1 * p and consists of 4 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * q + 1 and consists of 7 locations. One deterministic module has affine ranking function -1 * q + x and consists of 6 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 13 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function x + -1 * q and consists of 6 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function q and consists of 9 locations. One nondeterministic module has affine ranking function q and consists of 11 locations. 20 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.1s and 25 iterations. TraceHistogramMax:27. Analysis of lassos took 25.7s. Construction of modules took 3.1s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 30. Automata minimization 0.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 3182 StatesRemovedByMinimization, 30 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 1305 states and ocurred in iteration 20. Nontrivial modules had stage [7, 0, 5, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 119/179 HoareTripleCheckerStatistics: 1192 SDtfs, 1758 SDslu, 2727 SDs, 0 SdLazy, 6217 SolverSat, 1161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT4 conc0 concLT4 SILN0 SILU0 SILI3 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf96 lsp85 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq162 hnf92 smp98 dnf100 smp100 tf108 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 12 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 19.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...