./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 e334a37fa3ef1f2b757af8cdc97575f5cde09f8b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:01:24,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:01:24,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:01:24,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:01:24,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:01:24,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:01:24,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:01:24,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:01:24,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:01:24,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:01:24,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:01:24,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:01:24,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:01:24,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:01:24,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:01:24,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:01:24,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:01:24,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:01:24,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:01:24,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:01:24,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:01:24,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:01:24,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:01:24,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:01:24,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:01:24,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:01:24,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:01:24,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:01:24,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:01:24,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:01:24,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:01:24,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:01:24,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:01:24,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:01:24,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:01:24,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:01:24,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:01:24,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:01:24,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:01:24,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:01:24,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:01:24,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:01:24,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:01:24,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:01:24,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:01:24,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:01:24,157 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:01:24,157 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:01:24,157 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:01:24,157 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:01:24,158 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:01:24,158 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:01:24,158 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:01:24,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:01:24,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:01:24,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:01:24,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:01:24,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:01:24,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:01:24,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:01:24,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:01:24,160 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:01:24,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:01:24,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:01:24,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:01:24,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:01:24,162 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:01:24,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:01:24,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:01:24,162 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:01:24,163 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:01:24,163 INFO L138 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/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 -> e334a37fa3ef1f2b757af8cdc97575f5cde09f8b [2019-11-15 23:01:24,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:01:24,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:01:24,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:01:24,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:01:24,210 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:01:24,211 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-11-15 23:01:24,260 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/data/015798c1a/b76a805fd577413c93646947cd99cab7/FLAG99ba7b815 [2019-11-15 23:01:24,640 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:01:24,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-11-15 23:01:24,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/data/015798c1a/b76a805fd577413c93646947cd99cab7/FLAG99ba7b815 [2019-11-15 23:01:24,657 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/data/015798c1a/b76a805fd577413c93646947cd99cab7 [2019-11-15 23:01:24,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:01:24,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:01:24,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:01:24,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:01:24,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:01:24,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:24,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239325c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24, skipping insertion in model container [2019-11-15 23:01:24,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:24,687 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:01:24,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:01:24,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:01:24,946 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:01:24,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:01:24,972 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:01:24,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24 WrapperNode [2019-11-15 23:01:24,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:01:24,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:01:24,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:01:24,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:01:24,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:24,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:01:25,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:01:25,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:01:25,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:01:25,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... [2019-11-15 23:01:25,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:01:25,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:01:25,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:01:25,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:01:25,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:01:25,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:01:25,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:01:25,220 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:01:25,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:25 BoogieIcfgContainer [2019-11-15 23:01:25,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:01:25,222 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:01:25,222 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:01:25,225 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:01:25,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:01:25,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:01:24" (1/3) ... [2019-11-15 23:01:25,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38f6f668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:01:25, skipping insertion in model container [2019-11-15 23:01:25,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:01:25,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:01:24" (2/3) ... [2019-11-15 23:01:25,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38f6f668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:01:25, skipping insertion in model container [2019-11-15 23:01:25,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:01:25,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:25" (3/3) ... [2019-11-15 23:01:25,228 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-11-15 23:01:25,269 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:01:25,269 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:01:25,270 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:01:25,270 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:01:25,270 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:01:25,270 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:01:25,270 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:01:25,270 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:01:25,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:01:25,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:25,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:25,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:25,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:01:25,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:01:25,308 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:01:25,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:01:25,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:25,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:25,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:25,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:01:25,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:01:25,317 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 5#L18-2true [2019-11-15 23:01:25,317 INFO L793 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 11#L19true assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 7#L19-2true main_~y~0 := main_~y~0 - 1; 5#L18-2true [2019-11-15 23:01:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:25,322 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 23:01:25,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:25,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229866138] [2019-11-15 23:01:25,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash 40299, now seen corresponding path program 1 times [2019-11-15 23:01:25,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:25,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916122113] [2019-11-15 23:01:25,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:25,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 963820, now seen corresponding path program 1 times [2019-11-15 23:01:25,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:25,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526130764] [2019-11-15 23:01:25,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:25,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:25,465 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:25,514 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:25,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:25,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:25,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:25,515 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:25,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:25,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:25,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2019-11-15 23:01:25,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:25,516 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,666 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:25,666 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:25,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:25,674 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,687 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:25,687 INFO L440 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/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:25,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:25,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:25,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:25,707 INFO L440 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/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:25,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:25,714 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:25,723 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:25,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:25,730 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,734 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:25,735 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:25,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:25,747 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:25,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:25,766 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,777 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:25,779 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:25,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:25,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:25,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:25,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:25,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:25,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:25,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:25,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2019-11-15 23:01:25,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:25,780 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:25,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:25,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:25,887 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:25,889 INFO L120 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 [2019-11-15 23:01:25,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:25,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:25,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:25,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:25,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:25,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:25,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:25,915 INFO L120 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 [2019-11-15 23:01:25,916 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:25,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:25,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:25,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:25,919 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:25,919 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:25,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:25,927 INFO L120 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 [2019-11-15 23:01:25,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:25,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:25,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:25,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:25,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:25,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:25,930 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:25,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:25,931 INFO L120 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 [2019-11-15 23:01:25,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:25,932 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:25,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:25,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:25,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:25,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:25,933 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:25,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:25,936 INFO L120 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 [2019-11-15 23:01:25,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:25,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:25,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:25,937 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:25,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:25,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:25,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:25,944 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:25,949 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:25,949 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:01:25,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:25,951 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:25,951 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:25,952 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-11-15 23:01:25,955 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:26,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:26,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:26,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:26,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:26,052 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 [2019-11-15 23:01:26,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 3 states. [2019-11-15 23:01:26,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 3 states. Result 37 states and 54 transitions. Complement of second has 8 states. [2019-11-15 23:01:26,113 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 [2019-11-15 23:01:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:01:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-11-15 23:01:26,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-15 23:01:26,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 23:01:26,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-15 23:01:26,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2019-11-15 23:01:26,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:26,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 14 states and 20 transitions. [2019-11-15 23:01:26,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:01:26,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:01:26,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-11-15 23:01:26,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:26,134 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 23:01:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-11-15 23:01:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 23:01:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 23:01:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-15 23:01:26,161 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 23:01:26,161 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 23:01:26,161 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:01:26,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-15 23:01:26,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:26,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:26,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:26,163 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:01:26,163 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:01:26,163 INFO L791 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 93#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 91#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 98#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-11-15 23:01:26,163 INFO L793 eck$LassoCheckResult]: Loop: 99#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-11-15 23:01:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 963347, now seen corresponding path program 1 times [2019-11-15 23:01:26,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717818393] [2019-11-15 23:01:26,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,176 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2019-11-15 23:01:26,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010872477] [2019-11-15 23:01:26,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 29863779, now seen corresponding path program 2 times [2019-11-15 23:01:26,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187635584] [2019-11-15 23:01:26,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,198 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,216 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:26,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:26,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:26,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:26,217 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:26,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:26,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:26,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:26,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2019-11-15 23:01:26,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:26,217 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:26,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,283 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:26,284 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:26,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:26,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:26,300 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:26,300 INFO L440 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/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:26,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:26,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:26,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:26,316 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:26,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:26,327 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:26,332 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:26,333 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:26,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:26,347 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:26,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:26,367 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:26,500 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:26,503 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:26,503 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:26,503 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:26,503 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:26,503 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:26,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:26,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:26,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:26,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2019-11-15 23:01:26,503 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:26,503 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:26,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,595 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:26,596 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:26,596 INFO L120 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 [2019-11-15 23:01:26,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:26,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:26,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:26,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:26,599 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:26,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:26,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:26,610 INFO L120 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 [2019-11-15 23:01:26,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:26,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:26,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:26,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:26,616 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:26,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:26,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:26,627 INFO L120 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 [2019-11-15 23:01:26,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:26,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:26,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:26,629 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:01:26,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:26,631 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:01:26,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:26,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:26,648 INFO L120 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 [2019-11-15 23:01:26,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:26,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:26,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:26,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:26,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:26,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:26,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:26,656 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:26,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:26,664 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:01:26,666 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:26,667 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:26,667 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:26,667 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-11-15 23:01:26,668 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:26,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:26,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:26,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:26,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 23:01:26,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 2 states. [2019-11-15 23:01:26,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2019-11-15 23:01:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:01:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:01:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-15 23:01:26,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2019-11-15 23:01:26,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2019-11-15 23:01:26,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:01:26,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:26,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-11-15 23:01:26,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:26,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-11-15 23:01:26,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:01:26,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:01:26,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 23:01:26,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:26,732 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 23:01:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 23:01:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-15 23:01:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:01:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-11-15 23:01:26,734 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-11-15 23:01:26,738 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-11-15 23:01:26,738 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:01:26,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-11-15 23:01:26,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:26,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:26,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:26,743 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:01:26,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:01:26,744 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 163#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 168#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 177#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 176#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-11-15 23:01:26,744 INFO L793 eck$LassoCheckResult]: Loop: 169#L20-3 main_~x~0 := main_~x~0 - 1; 170#L19-2 main_~y~0 := main_~y~0 - 1; 164#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 165#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 173#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-11-15 23:01:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 29863777, now seen corresponding path program 1 times [2019-11-15 23:01:26,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593881391] [2019-11-15 23:01:26,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,780 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 1 times [2019-11-15 23:01:26,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994730735] [2019-11-15 23:01:26,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267692, now seen corresponding path program 1 times [2019-11-15 23:01:26,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:26,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820220379] [2019-11-15 23:01:26,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:26,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:26,825 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:26,863 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:26,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:26,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:26,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:26,864 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:26,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:26,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:26,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:26,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2019-11-15 23:01:26,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:26,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:26,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:26,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:27,007 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:27,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:27,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:27,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:27,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:27,166 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:27,168 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:27,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:27,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:27,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:27,168 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:27,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:27,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:27,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:27,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2019-11-15 23:01:27,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:27,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:27,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,312 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:27,312 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:27,313 INFO L120 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 [2019-11-15 23:01:27,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:27,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:27,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:27,314 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:01:27,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:27,315 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:01:27,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:27,336 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:27,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:27,340 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:01:27,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:27,341 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:27,341 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:27,341 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:01:27,341 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:27,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:27,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:27,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:27,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:27,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:27,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-15 23:01:27,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 46 states and 68 transitions. Complement of second has 8 states. [2019-11-15 23:01:27,441 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 [2019-11-15 23:01:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:01:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-15 23:01:27,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-15 23:01:27,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:27,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-15 23:01:27,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:27,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 23:01:27,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:27,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2019-11-15 23:01:27,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:27,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 32 states and 46 transitions. [2019-11-15 23:01:27,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:01:27,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 23:01:27,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2019-11-15 23:01:27,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:27,451 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-15 23:01:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2019-11-15 23:01:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-15 23:01:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:01:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-11-15 23:01:27,460 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-11-15 23:01:27,460 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-11-15 23:01:27,460 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:01:27,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2019-11-15 23:01:27,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:01:27,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:27,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:27,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-11-15 23:01:27,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:01:27,467 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 280#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 281#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 295#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L20-3 main_~x~0 := main_~x~0 - 1; 289#L19-2 main_~y~0 := main_~y~0 - 1; 292#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 305#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 304#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 302#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-11-15 23:01:27,467 INFO L793 eck$LassoCheckResult]: Loop: 298#L20-3 main_~x~0 := main_~x~0 - 1; 290#L19-2 main_~y~0 := main_~y~0 - 1; 291#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 299#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 294#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-11-15 23:01:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash -363863338, now seen corresponding path program 2 times [2019-11-15 23:01:27,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:27,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138040832] [2019-11-15 23:01:27,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:27,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:27,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:01:27,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138040832] [2019-11-15 23:01:27,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:01:27,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:01:27,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183465167] [2019-11-15 23:01:27,530 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:01:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 2 times [2019-11-15 23:01:27,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:27,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176729444] [2019-11-15 23:01:27,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:27,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:27,537 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:27,574 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:27,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:27,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:27,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:27,575 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:27,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:27,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:27,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:27,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2019-11-15 23:01:27,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:27,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:27,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,702 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:27,703 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/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 [2019-11-15 23:01:27,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:27,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:27,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:27,721 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=7} Honda state: {ULTIMATE.start_main_#t~nondet1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:27,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:27,726 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:27,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:27,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:27,775 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:27,777 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:27,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:27,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:27,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:27,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:27,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:27,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:27,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:27,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2019-11-15 23:01:27,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:27,778 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:27,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:27,898 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:27,898 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:27,899 INFO L120 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 [2019-11-15 23:01:27,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:27,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:27,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:27,900 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:01:27,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:27,900 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:01:27,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:27,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:27,904 INFO L120 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 [2019-11-15 23:01:27,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:27,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:27,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:27,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:27,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:27,906 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:27,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:27,908 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:27,912 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:27,914 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:01:27,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:27,915 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:27,915 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:27,915 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-15 23:01:27,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:27,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:27,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:27,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:27,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:27,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:27,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-15 23:01:28,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 80 states and 118 transitions. Complement of second has 7 states. [2019-11-15 23:01:28,000 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 [2019-11-15 23:01:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-11-15 23:01:28,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-15 23:01:28,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 15 letters. Loop has 5 letters. [2019-11-15 23:01:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 10 letters. [2019-11-15 23:01:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 118 transitions. [2019-11-15 23:01:28,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:01:28,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 54 states and 78 transitions. [2019-11-15 23:01:28,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:01:28,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:01:28,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. [2019-11-15 23:01:28,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:28,007 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2019-11-15 23:01:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. [2019-11-15 23:01:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-11-15 23:01:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:01:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2019-11-15 23:01:28,011 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-11-15 23:01:28,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:01:28,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:01:28,015 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2019-11-15 23:01:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:28,041 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2019-11-15 23:01:28,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:01:28,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-11-15 23:01:28,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:01:28,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 46 transitions. [2019-11-15 23:01:28,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:01:28,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:01:28,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-11-15 23:01:28,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:28,045 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-15 23:01:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-11-15 23:01:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 23:01:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 23:01:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-11-15 23:01:28,048 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-15 23:01:28,048 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-15 23:01:28,048 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:01:28,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2019-11-15 23:01:28,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:01:28,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:28,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:28,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-15 23:01:28,050 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:01:28,050 INFO L791 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 538#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 539#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 551#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 559#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 546#L20-3 main_~x~0 := main_~x~0 - 1; 547#L19-2 main_~y~0 := main_~y~0 - 1; 567#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 565#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 549#L20-2 [2019-11-15 23:01:28,050 INFO L793 eck$LassoCheckResult]: Loop: 549#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 549#L20-2 [2019-11-15 23:01:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1840994920, now seen corresponding path program 3 times [2019-11-15 23:01:28,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946519528] [2019-11-15 23:01:28,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2019-11-15 23:01:28,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711549724] [2019-11-15 23:01:28,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,069 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267694, now seen corresponding path program 4 times [2019-11-15 23:01:28,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170574542] [2019-11-15 23:01:28,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:28,098 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:28,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:28,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:28,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:28,098 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:28,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:28,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:28,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2019-11-15 23:01:28,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:28,099 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:28,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:28,194 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:28,197 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:28,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:28,339 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:28,341 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:28,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:28,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:28,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:28,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:28,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:28,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:28,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2019-11-15 23:01:28,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:28,342 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:28,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:28,405 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:28,405 INFO L120 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 [2019-11-15 23:01:28,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:28,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:28,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:28,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:28,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:28,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:28,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:28,408 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:28,410 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:28,410 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:01:28,411 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:28,411 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:28,411 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:28,411 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-11-15 23:01:28,411 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:28,448 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 23:01:28,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-11-15 23:01:28,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-11-15 23:01:28,464 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 [2019-11-15 23:01:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:01:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 23:01:28,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-15 23:01:28,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,464 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:01:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:28,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 23:01:28,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-11-15 23:01:28,505 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-11-15 23:01:28,506 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 [2019-11-15 23:01:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:01:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-15 23:01:28,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-15 23:01:28,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,507 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:01:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:28,544 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 23:01:28,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-11-15 23:01:28,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 38 states and 54 transitions. Complement of second has 4 states. [2019-11-15 23:01:28,558 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 [2019-11-15 23:01:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:01:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 23:01:28,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-15 23:01:28,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2019-11-15 23:01:28,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 23:01:28,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:28,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2019-11-15 23:01:28,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:28,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 37 transitions. [2019-11-15 23:01:28,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:01:28,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:01:28,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-11-15 23:01:28,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:28,562 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-11-15 23:01:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-11-15 23:01:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-11-15 23:01:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 23:01:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-11-15 23:01:28,563 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 23:01:28,564 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 23:01:28,564 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:01:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-11-15 23:01:28,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:28,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:28,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:28,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2019-11-15 23:01:28,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:01:28,565 INFO L791 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 799#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 806#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 803#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 804#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 802#L20-3 main_~x~0 := main_~x~0 - 1; 801#L19-2 main_~y~0 := main_~y~0 - 1; 796#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 797#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 807#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 810#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 813#L20-3 main_~x~0 := main_~x~0 - 1; 812#L19-2 main_~y~0 := main_~y~0 - 1; 811#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 808#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-11-15 23:01:28,565 INFO L793 eck$LassoCheckResult]: Loop: 800#L19-2 main_~y~0 := main_~y~0 - 1; 794#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 795#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-11-15 23:01:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1970756676, now seen corresponding path program 1 times [2019-11-15 23:01:28,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348324202] [2019-11-15 23:01:28,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,582 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 2 times [2019-11-15 23:01:28,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028638003] [2019-11-15 23:01:28,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:28,587 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1390830772, now seen corresponding path program 2 times [2019-11-15 23:01:28,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:28,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120055865] [2019-11-15 23:01:28,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:28,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:01:28,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120055865] [2019-11-15 23:01:28,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672037127] [2019-11-15 23:01:28,624 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:01:28,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:01:28,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:01:28,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:01:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:01:28,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:01:28,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 23:01:28,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115906784] [2019-11-15 23:01:28,712 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:28,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:28,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:28,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:28,712 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:28,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:28,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:28,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2019-11-15 23:01:28,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:28,713 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:28,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,772 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:28,772 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:28,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:28,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:01:28,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:28,796 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:28,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:28,815 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:28,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:28,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:28,832 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:28,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:28,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:28,842 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:28,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:28,852 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:28,891 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:28,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:28,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:28,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:28,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:28,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:28,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:28,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:28,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2019-11-15 23:01:28,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:28,892 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:28,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:28,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:28,976 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:28,976 INFO L120 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 [2019-11-15 23:01:28,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:28,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:28,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:28,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:28,978 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:28,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:28,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:28,981 INFO L120 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 [2019-11-15 23:01:28,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:28,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:28,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:28,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:28,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:28,982 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:28,982 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:28,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:28,985 INFO L120 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 [2019-11-15 23:01:28,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:28,986 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:28,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:28,987 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:28,987 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:28,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:28,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:28,989 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:28,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:28,991 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:01:28,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:28,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:28,992 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:28,992 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:01:28,992 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:29,046 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:29,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 23:01:29,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 63 states and 85 transitions. Complement of second has 7 states. [2019-11-15 23:01:29,070 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 [2019-11-15 23:01:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:01:29,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:01:29,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 23:01:29,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 23:01:29,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2019-11-15 23:01:29,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 44 states and 59 transitions. [2019-11-15 23:01:29,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:01:29,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:01:29,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2019-11-15 23:01:29,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:29,073 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-11-15 23:01:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2019-11-15 23:01:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-11-15 23:01:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:01:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-15 23:01:29,075 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-15 23:01:29,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:01:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:01:29,076 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 5 states. [2019-11-15 23:01:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,097 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-11-15 23:01:29,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:01:29,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2019-11-15 23:01:29,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 45 states and 58 transitions. [2019-11-15 23:01:29,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:01:29,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:01:29,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2019-11-15 23:01:29,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:29,100 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-11-15 23:01:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2019-11-15 23:01:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-11-15 23:01:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:01:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-11-15 23:01:29,104 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-11-15 23:01:29,105 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-11-15 23:01:29,105 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:01:29,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-11-15 23:01:29,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:29,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:29,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1] [2019-11-15 23:01:29,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:01:29,106 INFO L791 eck$LassoCheckResult]: Stem: 1103#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1104#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1112#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1108#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1109#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1133#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1107#L20-3 main_~x~0 := main_~x~0 - 1; 1106#L19-2 main_~y~0 := main_~y~0 - 1; 1101#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1102#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1124#L19-2 main_~y~0 := main_~y~0 - 1; 1127#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1123#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1121#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1117#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1120#L20-3 main_~x~0 := main_~x~0 - 1; 1119#L19-2 main_~y~0 := main_~y~0 - 1; 1118#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1115#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-11-15 23:01:29,106 INFO L793 eck$LassoCheckResult]: Loop: 1105#L19-2 main_~y~0 := main_~y~0 - 1; 1099#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1100#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-11-15 23:01:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 715204654, now seen corresponding path program 3 times [2019-11-15 23:01:29,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417261511] [2019-11-15 23:01:29,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,121 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 3 times [2019-11-15 23:01:29,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274464387] [2019-11-15 23:01:29,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,127 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash -670878974, now seen corresponding path program 4 times [2019-11-15 23:01:29,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232197890] [2019-11-15 23:01:29,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:01:29,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232197890] [2019-11-15 23:01:29,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482862011] [2019-11-15 23:01:29,174 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:01:29,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:01:29,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:01:29,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:01:29,229 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:01:29,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 23:01:29,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024007272] [2019-11-15 23:01:29,249 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:29,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:29,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:29,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:29,249 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:29,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:29,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:29,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2019-11-15 23:01:29,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:29,250 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:29,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:29,317 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:29,332 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,338 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:29,338 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:29,344 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:29,355 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,390 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:29,392 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:29,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:29,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:29,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:29,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:29,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:29,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:29,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2019-11-15 23:01:29,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:29,393 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:29,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:29,475 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:29,475 INFO L120 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 [2019-11-15 23:01:29,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:29,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:29,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:29,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:29,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:29,476 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:29,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:29,478 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:29,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:29,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:01:29,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:29,480 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:29,480 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:29,480 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:01:29,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:29,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:29,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-15 23:01:29,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 7 states. [2019-11-15 23:01:29,561 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 [2019-11-15 23:01:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:01:29,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-15 23:01:29,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,562 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:01:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:29,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:29,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-11-15 23:01:29,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 74 states and 97 transitions. Complement of second has 9 states. [2019-11-15 23:01:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:01:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 23:01:29,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-15 23:01:29,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 23:01:29,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-15 23:01:29,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:29,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2019-11-15 23:01:29,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 89 transitions. [2019-11-15 23:01:29,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:01:29,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:01:29,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2019-11-15 23:01:29,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:29,658 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 89 transitions. [2019-11-15 23:01:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2019-11-15 23:01:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-11-15 23:01:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:01:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-11-15 23:01:29,663 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-11-15 23:01:29,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:01:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:01:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:01:29,663 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-11-15 23:01:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:01:29,696 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2019-11-15 23:01:29,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:01:29,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-11-15 23:01:29,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 107 states and 137 transitions. [2019-11-15 23:01:29,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:01:29,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:01:29,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 137 transitions. [2019-11-15 23:01:29,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:01:29,700 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 137 transitions. [2019-11-15 23:01:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 137 transitions. [2019-11-15 23:01:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2019-11-15 23:01:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 23:01:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-11-15 23:01:29,706 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-11-15 23:01:29,706 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-11-15 23:01:29,706 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:01:29,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2019-11-15 23:01:29,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:01:29,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:01:29,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:01:29,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1] [2019-11-15 23:01:29,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:01:29,709 INFO L791 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1706#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1719#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1715#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1716#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1754#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1753#L20-3 main_~x~0 := main_~x~0 - 1; 1752#L19-2 main_~y~0 := main_~y~0 - 1; 1750#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1751#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1742#L19-2 main_~y~0 := main_~y~0 - 1; 1741#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1738#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1735#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1732#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1734#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1724#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1727#L20-3 main_~x~0 := main_~x~0 - 1; 1726#L19-2 main_~y~0 := main_~y~0 - 1; 1725#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1722#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-11-15 23:01:29,709 INFO L793 eck$LassoCheckResult]: Loop: 1713#L19-2 main_~y~0 := main_~y~0 - 1; 1707#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1708#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-11-15 23:01:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1768639598, now seen corresponding path program 5 times [2019-11-15 23:01:29,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438681977] [2019-11-15 23:01:29,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 4 times [2019-11-15 23:01:29,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37229832] [2019-11-15 23:01:29,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,728 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1116494142, now seen corresponding path program 6 times [2019-11-15 23:01:29,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:01:29,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118638268] [2019-11-15 23:01:29,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:01:29,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:01:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:01:29,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:01:29,763 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:29,763 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:29,763 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:29,763 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:29,763 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:01:29,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:29,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:29,764 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2019-11-15 23:01:29,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:29,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:29,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,826 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:29,826 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:29,831 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:01:29,835 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:01:29,844 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b8c1e18-9c65-43af-bfe7-0f492b19e392/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:01:29,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:01:29,853 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,888 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:01:29,890 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:01:29,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:01:29,890 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:01:29,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:01:29,891 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:01:29,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:01:29,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:01:29,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:01:29,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2019-11-15 23:01:29,891 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:01:29,891 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:01:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:01:29,949 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:01:29,949 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:01:29,949 INFO L120 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 [2019-11-15 23:01:29,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:29,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:29,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:29,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:29,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:01:29,952 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:01:29,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:01:29,954 INFO L120 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 [2019-11-15 23:01:29,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:01:29,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:01:29,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:01:29,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:01:29,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:01:29,955 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:01:29,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:01:29,957 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:01:29,958 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:01:29,959 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:01:29,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:01:29,959 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:01:29,960 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:01:29,960 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:01:29,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:01:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:29,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:29,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:30,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:30,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-11-15 23:01:30,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 101 states and 134 transitions. Complement of second has 7 states. [2019-11-15 23:01:30,033 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 [2019-11-15 23:01:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:01:30,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-15 23:01:30,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:30,033 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:01:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:30,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:30,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:30,074 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:30,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-11-15 23:01:30,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 128 states and 166 transitions. Complement of second has 9 states. [2019-11-15 23:01:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:01:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 23:01:30,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-15 23:01:30,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:30,107 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:01:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:01:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:01:30,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:01:30,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:01:30,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:01:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:01:30,167 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:01:30,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-11-15 23:01:30,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 139 states and 187 transitions. Complement of second has 8 states. [2019-11-15 23:01:30,190 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 [2019-11-15 23:01:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:01:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 23:01:30,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-15 23:01:30,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:30,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 23:01:30,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:30,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 6 letters. [2019-11-15 23:01:30,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:01:30,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 187 transitions. [2019-11-15 23:01:30,193 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:01:30,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2019-11-15 23:01:30,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:01:30,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:01:30,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:01:30,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:01:30,194 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:01:30,194 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:01:30,194 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:01:30,194 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:01:30,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:01:30,194 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:01:30,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:01:30,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:01:30 BoogieIcfgContainer [2019-11-15 23:01:30,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:01:30,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:01:30,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:01:30,201 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:01:30,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:01:25" (3/4) ... [2019-11-15 23:01:30,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:01:30,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:01:30,207 INFO L168 Benchmark]: Toolchain (without parser) took 5545.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 945.1 MB in the beginning and 892.6 MB in the end (delta: 52.5 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:30,207 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:01:30,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:30,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:01:30,209 INFO L168 Benchmark]: Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:01:30,209 INFO L168 Benchmark]: RCFGBuilder took 201.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:30,210 INFO L168 Benchmark]: BuchiAutomizer took 4978.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 892.6 MB in the end (delta: 229.4 MB). Peak memory consumption was 318.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:01:30,210 INFO L168 Benchmark]: Witness Printer took 4.13 ms. Allocated memory is still 1.3 GB. Free memory is still 892.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:01:30,213 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 962.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 201.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4978.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 892.6 MB in the end (delta: 229.4 MB). Peak memory consumption was 318.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.13 ms. Allocated memory is still 1.3 GB. Free memory is still 892.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (3 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 155 SDslu, 81 SDs, 0 SdLazy, 157 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf94 smp100 dnf112 smp100 tf111 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...