./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Flip2_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Flip2_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/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 cda310f9ec541637625c4cf2e3662e22b6979f61 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:04:14,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:04:14,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:04:14,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:04:14,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:04:14,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:04:14,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:04:14,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:04:14,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:04:14,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:04:14,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:04:14,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:04:14,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:04:14,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:04:14,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:04:14,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:04:14,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:04:14,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:04:14,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:04:14,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:04:14,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:04:14,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:04:14,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:04:14,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:04:14,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:04:14,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:04:14,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:04:14,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:04:14,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:04:14,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:04:14,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:04:14,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:04:14,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:04:14,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:04:14,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:04:14,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:04:14,067 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:04:14,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:04:14,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:04:14,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:04:14,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:04:14,083 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:04:14,083 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:04:14,083 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:04:14,084 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:04:14,084 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:04:14,084 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:04:14,084 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:04:14,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:04:14,085 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:04:14,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:04:14,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:04:14,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:04:14,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:04:14,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:04:14,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:04:14,088 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:04:14,088 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:04:14,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:04:14,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:04:14,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:04:14,089 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:04:14,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:04:14,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:04:14,089 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:04:14,090 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:04:14,090 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_df1f93bc-a1a1-48a0-8523-9dac05ab5864/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 -> cda310f9ec541637625c4cf2e3662e22b6979f61 [2018-11-23 06:04:14,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:04:14,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:04:14,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:04:14,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:04:14,136 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:04:14,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/Flip2_false-termination_true-no-overflow.c [2018-11-23 06:04:14,192 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/data/30230e2b1/1b3afbeab02b4ed395e5ba10d754ebcf/FLAG74ae64d5d [2018-11-23 06:04:14,533 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:04:14,534 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/sv-benchmarks/c/termination-restricted-15/Flip2_false-termination_true-no-overflow.c [2018-11-23 06:04:14,538 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/data/30230e2b1/1b3afbeab02b4ed395e5ba10d754ebcf/FLAG74ae64d5d [2018-11-23 06:04:14,551 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/data/30230e2b1/1b3afbeab02b4ed395e5ba10d754ebcf [2018-11-23 06:04:14,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:04:14,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:04:14,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:04:14,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:04:14,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:04:14,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e96e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14, skipping insertion in model container [2018-11-23 06:04:14,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:04:14,593 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:04:14,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:04:14,759 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:04:14,770 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:04:14,780 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:04:14,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14 WrapperNode [2018-11-23 06:04:14,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:04:14,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:04:14,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:04:14,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:04:14,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:04:14,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:04:14,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:04:14,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:04:14,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... [2018-11-23 06:04:14,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:04:14,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:04:14,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:04:14,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:04:14,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:14,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:04:14,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:04:15,007 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:04:15,007 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 06:04:15,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:04:15 BoogieIcfgContainer [2018-11-23 06:04:15,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:04:15,008 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:04:15,008 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:04:15,011 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:04:15,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:15,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:04:14" (1/3) ... [2018-11-23 06:04:15,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28ea3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:04:15, skipping insertion in model container [2018-11-23 06:04:15,013 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:15,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:04:14" (2/3) ... [2018-11-23 06:04:15,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28ea3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:04:15, skipping insertion in model container [2018-11-23 06:04:15,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:04:15,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:04:15" (3/3) ... [2018-11-23 06:04:15,016 INFO L375 chiAutomizerObserver]: Analyzing ICFG Flip2_false-termination_true-no-overflow.c [2018-11-23 06:04:15,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:04:15,063 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:04:15,063 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:04:15,063 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:04:15,063 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:04:15,063 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:04:15,063 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:04:15,063 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:04:15,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:04:15,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-23 06:04:15,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:04:15,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:15,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:15,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:04:15,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:04:15,098 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:04:15,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-23 06:04:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:04:15,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:15,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:15,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 06:04:15,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:04:15,105 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 6#L19-2true [2018-11-23 06:04:15,105 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 > 0 && main_~j~0 > 0); 10#L14true assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 6#L19-2true [2018-11-23 06:04:15,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 06:04:15,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-23 06:04:15,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-23 06:04:15,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:15,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:15,286 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:15,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:15,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:15,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:15,288 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:15,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:15,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:15,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:15,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 06:04:15,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:15,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:15,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:15,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:15,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:15,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:15,485 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:15,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:15,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:15,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:15,518 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:15,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:15,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:15,553 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:15,554 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:15,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:15,560 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:15,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:15,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:16,592 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:16,594 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:16,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:16,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:16,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:16,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:16,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:16,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:16,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:16,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 06:04:16,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:16,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:16,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:16,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:16,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:16,676 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:16,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:16,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:16,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:16,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:16,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:16,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:16,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:16,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:16,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:16,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:16,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:16,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:16,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:16,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:16,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:16,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:16,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:16,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:16,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:16,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:16,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:16,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:16,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:16,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:16,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:16,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:16,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:04:16,728 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:04:16,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:16,730 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:16,731 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:16,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 06:04:16,732 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:16,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:16,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:16,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:16,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:16,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2018-11-23 06:04:16,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 30 states and 43 transitions. Complement of second has 8 states. [2018-11-23 06:04:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:04:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-23 06:04:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-23 06:04:16,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 06:04:16,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-23 06:04:16,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:16,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2018-11-23 06:04:16,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:04:16,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 19 transitions. [2018-11-23 06:04:16,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 06:04:16,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 06:04:16,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-23 06:04:16,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:16,894 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-23 06:04:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-23 06:04:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-23 06:04:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 06:04:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-11-23 06:04:16,917 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 06:04:16,917 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2018-11-23 06:04:16,917 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:04:16,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2018-11-23 06:04:16,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 06:04:16,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:16,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:16,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:04:16,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:04:16,918 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 76#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 78#L14 [2018-11-23 06:04:16,918 INFO L796 eck$LassoCheckResult]: Loop: 78#L14 assume !(main_~i~0 < main_~j~0); 84#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 77#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 78#L14 [2018-11-23 06:04:16,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2018-11-23 06:04:16,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 44836, now seen corresponding path program 1 times [2018-11-23 06:04:16,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 29865627, now seen corresponding path program 1 times [2018-11-23 06:04:16,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:16,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:16,969 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:16,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:16,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:16,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:16,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:16,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:16,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:16,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:16,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 06:04:16,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:16,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:16,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:16,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:16,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:17,024 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:17,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:17,063 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:17,063 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:17,068 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:17,099 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:17,197 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:17,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:17,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:17,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:17,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:17,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:17,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:17,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:17,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 06:04:17,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:17,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:17,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:17,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:17,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:17,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:17,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:17,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:17,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:17,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:17,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:17,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:17,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:17,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:17,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:17,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:17,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:17,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:17,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:17,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:17,298 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:17,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:04:17,305 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:04:17,305 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:17,305 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:17,305 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:17,306 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 06:04:17,306 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:17,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:17,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:17,343 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 06:04:17,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 34 states and 49 transitions. Complement of second has 7 states. [2018-11-23 06:04:17,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:04:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-23 06:04:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-23 06:04:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 06:04:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-23 06:04:17,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2018-11-23 06:04:17,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:04:17,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 44 transitions. [2018-11-23 06:04:17,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 06:04:17,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 06:04:17,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2018-11-23 06:04:17,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:17,369 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-11-23 06:04:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2018-11-23 06:04:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 06:04:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 06:04:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-11-23 06:04:17,372 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-11-23 06:04:17,372 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-11-23 06:04:17,372 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:04:17,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2018-11-23 06:04:17,374 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-23 06:04:17,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:17,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:17,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 06:04:17,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:04:17,375 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 161#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 173#L14 assume !(main_~i~0 < main_~j~0); 166#L19 [2018-11-23 06:04:17,375 INFO L796 eck$LassoCheckResult]: Loop: 166#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 167#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 179#L14 assume !(main_~i~0 < main_~j~0); 166#L19 [2018-11-23 06:04:17,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-23 06:04:17,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:17,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:17,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,381 INFO L82 PathProgramCache]: Analyzing trace with hash 47414, now seen corresponding path program 1 times [2018-11-23 06:04:17,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:17,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:17,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 925832530, now seen corresponding path program 1 times [2018-11-23 06:04:17,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:17,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:17,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,427 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:17,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:17,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:17,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:17,428 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:17,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:17,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:17,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 06:04:17,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:17,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:17,469 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:17,472 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:17,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:04:17,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:17,497 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:17,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:17,670 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:17,672 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:17,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:17,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:17,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:17,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:17,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:17,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:17,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 06:04:17,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:17,673 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:17,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:17,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:17,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:17,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:17,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:17,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:17,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:17,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:17,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:17,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:17,719 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:04:17,719 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:04:17,720 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:17,720 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:17,720 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:17,720 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 06:04:17,721 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:17,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:17,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:17,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 37 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-11-23 06:04:17,780 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 37 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 62 states and 91 transitions. Complement of second has 5 states. [2018-11-23 06:04:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:04:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-23 06:04:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 06:04:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 06:04:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 06:04:17,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:17,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 91 transitions. [2018-11-23 06:04:17,784 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-23 06:04:17,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 80 transitions. [2018-11-23 06:04:17,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 06:04:17,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 06:04:17,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2018-11-23 06:04:17,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:17,786 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2018-11-23 06:04:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2018-11-23 06:04:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-23 06:04:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 06:04:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2018-11-23 06:04:17,790 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2018-11-23 06:04:17,790 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 60 transitions. [2018-11-23 06:04:17,790 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:04:17,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 60 transitions. [2018-11-23 06:04:17,791 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2018-11-23 06:04:17,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:17,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:17,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-23 06:04:17,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 06:04:17,792 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 286#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 316#L14 assume !(main_~i~0 < main_~j~0); 291#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 292#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 304#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 299#L19-2 [2018-11-23 06:04:17,792 INFO L796 eck$LassoCheckResult]: Loop: 299#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 309#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 299#L19-2 [2018-11-23 06:04:17,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash 925832528, now seen corresponding path program 1 times [2018-11-23 06:04:17,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:17,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:17,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:04:17,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:04:17,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:17,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-23 06:04:17,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:17,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:17,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:17,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:17,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:17,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:17,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:17,852 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:17,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:17,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:17,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 06:04:17,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:17,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:17,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:17,939 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:17,940 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:17,952 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:17,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:17,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:18,428 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:18,430 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:18,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:18,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:18,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:18,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:18,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:18,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:18,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:18,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 06:04:18,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:18,432 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:18,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,477 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:18,477 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:18,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:18,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:18,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:18,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:18,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:18,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:18,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:18,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:18,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:18,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:18,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:18,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:18,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:18,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:04:18,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:04:18,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:04:18,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:18,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:18,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:18,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:18,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:18,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:18,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:18,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:18,495 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:18,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 06:04:18,497 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 06:04:18,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:18,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:18,498 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:18,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 06:04:18,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:18,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:18,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:18,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:18,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:18,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 60 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-23 06:04:18,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 60 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 73 states and 104 transitions. Complement of second has 7 states. [2018-11-23 06:04:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:04:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 06:04:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-23 06:04:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 06:04:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 06:04:18,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 104 transitions. [2018-11-23 06:04:18,559 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2018-11-23 06:04:18,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 57 states and 83 transitions. [2018-11-23 06:04:18,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 06:04:18,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 06:04:18,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 83 transitions. [2018-11-23 06:04:18,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:18,561 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 83 transitions. [2018-11-23 06:04:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 83 transitions. [2018-11-23 06:04:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-23 06:04:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 06:04:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2018-11-23 06:04:18,564 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2018-11-23 06:04:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:04:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:04:18,568 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 3 states. [2018-11-23 06:04:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:18,582 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2018-11-23 06:04:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:04:18,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2018-11-23 06:04:18,583 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 06:04:18,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 61 transitions. [2018-11-23 06:04:18,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 06:04:18,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 06:04:18,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 61 transitions. [2018-11-23 06:04:18,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:18,585 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2018-11-23 06:04:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 61 transitions. [2018-11-23 06:04:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 06:04:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 06:04:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2018-11-23 06:04:18,588 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-11-23 06:04:18,588 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2018-11-23 06:04:18,588 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:04:18,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2018-11-23 06:04:18,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 06:04:18,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:18,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:18,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-23 06:04:18,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:04:18,590 INFO L794 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 538#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 552#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 574#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 547#L14 assume !(main_~i~0 < main_~j~0); 548#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 544#L19-2 [2018-11-23 06:04:18,590 INFO L796 eck$LassoCheckResult]: Loop: 544#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 573#L14 assume !(main_~i~0 < main_~j~0); 543#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 544#L19-2 [2018-11-23 06:04:18,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash 925765420, now seen corresponding path program 1 times [2018-11-23 06:04:18,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:18,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:18,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:04:18,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:04:18,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:04:18,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 39886, now seen corresponding path program 2 times [2018-11-23 06:04:18,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,654 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:18,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:18,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:18,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:18,655 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:04:18,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:18,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:18,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:18,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 06:04:18,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:18,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:18,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,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-23 06:04:18,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-23 06:04:18,689 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:18,689 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:18,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:04:18,694 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:18,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:04:18,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:04:18,771 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:04:18,773 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:04:18,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:04:18,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:04:18,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:04:18,773 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:04:18,773 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:04:18,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:04:18,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:04:18,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: Flip2_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 06:04:18,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:04:18,774 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:04:18,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:04:18,813 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:04:18,813 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:04:18,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:04:18,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:04:18,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:04:18,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:04:18,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:04:18,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:04:18,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:04:18,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:04:18,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:04:18,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 06:04:18,820 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:04:18,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:04:18,820 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 06:04:18,820 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:04:18,821 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 06:04:18,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 06:04:18,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:18,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:04:18,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:04:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:04:18,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:04:18,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-23 06:04:18,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 73 states and 101 transitions. Complement of second has 5 states. [2018-11-23 06:04:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:04:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:04:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-23 06:04:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 06:04:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 06:04:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 06:04:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:04:18,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-11-23 06:04:18,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 06:04:18,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 78 transitions. [2018-11-23 06:04:18,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 06:04:18,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 06:04:18,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 78 transitions. [2018-11-23 06:04:18,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:18,878 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 78 transitions. [2018-11-23 06:04:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 78 transitions. [2018-11-23 06:04:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-23 06:04:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 06:04:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2018-11-23 06:04:18,881 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 68 transitions. [2018-11-23 06:04:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:04:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:04:18,882 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 3 states. [2018-11-23 06:04:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:04:18,891 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 06:04:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:04:18,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2018-11-23 06:04:18,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:04:18,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 60 transitions. [2018-11-23 06:04:18,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 06:04:18,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 06:04:18,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 60 transitions. [2018-11-23 06:04:18,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:04:18,893 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 06:04:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 60 transitions. [2018-11-23 06:04:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-11-23 06:04:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 06:04:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-11-23 06:04:18,895 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2018-11-23 06:04:18,895 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2018-11-23 06:04:18,896 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:04:18,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2018-11-23 06:04:18,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 06:04:18,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:04:18,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:04:18,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2018-11-23 06:04:18,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1] [2018-11-23 06:04:18,897 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; 796#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 810#L14 assume !(main_~i~0 < main_~j~0); 803#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 804#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 805#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 797#L19-2 [2018-11-23 06:04:18,897 INFO L796 eck$LassoCheckResult]: Loop: 797#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 798#L14 assume !(main_~i~0 < main_~j~0); 801#L19 assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; 802#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 828#L14 assume !(main_~i~0 < main_~j~0); 825#L19 assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; 826#L19-2 assume !!(main_~i~0 > 0 && main_~j~0 > 0); 827#L14 assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; 797#L19-2 [2018-11-23 06:04:18,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 925834450, now seen corresponding path program 2 times [2018-11-23 06:04:18,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash -606540634, now seen corresponding path program 1 times [2018-11-23 06:04:18,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:04:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:04:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash -66410377, now seen corresponding path program 1 times [2018-11-23 06:04:18,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:04:18,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:04:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:04:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:04:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:04:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- [2018-11-23 06:04:19,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:04:19 BoogieIcfgContainer [2018-11-23 06:04:19,017 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:04:19,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:04:19,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:04:19,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:04:19,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:04:15" (3/4) ... [2018-11-23 06:04:19,021 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- [2018-11-23 06:04:19,076 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_df1f93bc-a1a1-48a0-8523-9dac05ab5864/bin-2019/uautomizer/witness.graphml [2018-11-23 06:04:19,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:04:19,077 INFO L168 Benchmark]: Toolchain (without parser) took 4522.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -83.6 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,078 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:04:19,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.23 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.92 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,079 INFO L168 Benchmark]: Boogie Preprocessor took 14.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:04:19,080 INFO L168 Benchmark]: RCFGBuilder took 186.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,080 INFO L168 Benchmark]: BuchiAutomizer took 4009.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,081 INFO L168 Benchmark]: Witness Printer took 59.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:04:19,083 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.23 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.92 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4009.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * Witness Printer took 59.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i + -1 * j and consists of 3 locations. One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 29 SDslu, 6 SDs, 0 SdLazy, 80 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax176 hnf97 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf92 smp100 dnf100 smp100 tf109 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {t=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ce0dec2=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6763a7c2=0, i=2, j=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 13]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0;havoc main_~i~0;havoc main_~j~0;havoc main_~t~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~t~0 := 0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~t~0; [L6] havoc main_~i~0; [L7] havoc main_~j~0; [L8] havoc main_~t~0; [L9] main_~i~0 := main_#t~nondet0; [L9] havoc main_#t~nondet0; [L10] main_~j~0 := main_#t~nondet1; [L10] havoc main_#t~nondet1; [L11] main_~t~0 := 0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~j~0; [L8] havoc ~t~0; [L9] ~i~0 := #t~nondet0; [L9] havoc #t~nondet0; [L10] ~j~0 := #t~nondet1; [L10] havoc #t~nondet1; [L11] ~t~0 := 0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume main_~i~0 > main_~j~0;main_~j~0 := main_~i~0; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume !(main_~i~0 < main_~j~0); [?] assume !(main_~i~0 > main_~j~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [?] assume main_~i~0 < main_~j~0;main_~t~0 := main_~i~0;main_~i~0 := main_~j~0;main_~j~0 := main_~t~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume main_~i~0 > main_~j~0; [L20] main_~j~0 := main_~i~0; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume !(main_~i~0 < main_~j~0); [L19-L23] assume !(main_~i~0 > main_~j~0); [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] assume !!(main_~i~0 > 0 && main_~j~0 > 0); [L14-L24] assume main_~i~0 < main_~j~0; [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND TRUE main_~i~0 > main_~j~0 [L20] main_~j~0 := main_~i~0; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND FALSE !(main_~i~0 < main_~j~0) [L19] COND FALSE !(main_~i~0 > main_~j~0) [L22] main_~i~0 := main_~i~0 - 1; [L13-L25] COND FALSE !(!(main_~i~0 > 0 && main_~j~0 > 0)) [L14] COND TRUE main_~i~0 < main_~j~0 [L15] main_~t~0 := main_~i~0; [L16] main_~i~0 := main_~j~0; [L17] main_~j~0 := main_~t~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND TRUE ~i~0 > ~j~0 [L20] ~j~0 := ~i~0; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND FALSE !(~i~0 < ~j~0) [L19] COND FALSE !(~i~0 > ~j~0) [L22] ~i~0 := ~i~0 - 1; [L13-L25] COND FALSE !(!(~i~0 > 0 && ~j~0 > 0)) [L14] COND TRUE ~i~0 < ~j~0 [L15] ~t~0 := ~i~0; [L16] ~i~0 := ~j~0; [L17] ~j~0 := ~t~0; [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int t; [L9] i = __VERIFIER_nondet_int() [L10] j = __VERIFIER_nondet_int() [L11] t = 0 [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t Loop: [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND TRUE i > j [L20] j = i [L13] COND TRUE i > 0 && j > 0 [L14] COND FALSE !(i < j) [L19] COND FALSE !(i > j) [L22] i = i-1 [L13] COND TRUE i > 0 && j > 0 [L14] COND TRUE i < j [L15] t = i [L16] i = j [L17] j = t End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...