./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_04.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_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 8d3fb7268073fcc251f9902f5b4913f30f169781 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:44:36,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:44:36,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:44:36,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:44:36,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:44:36,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:44:36,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:44:36,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:44:36,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:44:36,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:44:36,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:44:36,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:44:36,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:44:36,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:44:36,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:44:36,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:44:36,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:44:36,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:44:36,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:44:36,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:44:36,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:44:36,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:44:36,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:44:36,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:44:36,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:44:36,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:44:36,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:44:36,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:44:36,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:44:36,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:44:36,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:44:36,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:44:36,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:44:36,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:44:36,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:44:36,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:44:36,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:44:36,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:44:36,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:44:36,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:44:36,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:44:36,963 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:44:36,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:44:37,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:44:37,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:44:37,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:44:37,014 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:44:37,014 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:44:37,015 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:44:37,015 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:44:37,015 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:44:37,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:44:37,016 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:44:37,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:44:37,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:44:37,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:44:37,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:44:37,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:44:37,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:44:37,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:44:37,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:44:37,019 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:44:37,019 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:44:37,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:44:37,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:44:37,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:44:37,020 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:44:37,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:44:37,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:44:37,021 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:44:37,022 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:44:37,026 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_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 -> 8d3fb7268073fcc251f9902f5b4913f30f169781 [2019-11-15 20:44:37,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:44:37,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:44:37,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:44:37,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:44:37,093 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:44:37,094 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_04.c [2019-11-15 20:44:37,170 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/data/70739fd2f/d87c5891d6884725a4636618ef9f4f69/FLAGea0e7584c [2019-11-15 20:44:37,628 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:44:37,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/sv-benchmarks/c/termination-restricted-15/NO_04.c [2019-11-15 20:44:37,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/data/70739fd2f/d87c5891d6884725a4636618ef9f4f69/FLAGea0e7584c [2019-11-15 20:44:38,005 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/data/70739fd2f/d87c5891d6884725a4636618ef9f4f69 [2019-11-15 20:44:38,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:44:38,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:44:38,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:38,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:44:38,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:44:38,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7975bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38, skipping insertion in model container [2019-11-15 20:44:38,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:44:38,038 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:44:38,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:38,231 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:44:38,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:44:38,387 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:44:38,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38 WrapperNode [2019-11-15 20:44:38,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:44:38,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:38,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:44:38,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:44:38,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:44:38,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:44:38,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:44:38,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:44:38,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... [2019-11-15 20:44:38,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:44:38,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:44:38,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:44:38,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:44:38,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 20:44:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:44:38,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:44:38,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:44:38,865 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:44:38,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:38 BoogieIcfgContainer [2019-11-15 20:44:38,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:44:38,867 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:44:38,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:44:38,872 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:44:38,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:44:38,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:44:38" (1/3) ... [2019-11-15 20:44:38,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdce9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:44:38, skipping insertion in model container [2019-11-15 20:44:38,876 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:44:38,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:44:38" (2/3) ... [2019-11-15 20:44:38,877 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdce9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:44:38, skipping insertion in model container [2019-11-15 20:44:38,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:44:38,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:38" (3/3) ... [2019-11-15 20:44:38,880 INFO L371 chiAutomizerObserver]: Analyzing ICFG NO_04.c [2019-11-15 20:44:38,937 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:44:38,938 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:44:38,938 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:44:38,938 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:44:38,938 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:44:38,938 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:44:38,939 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:44:38,939 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:44:38,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:44:38,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 20:44:38,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:38,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:38,986 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:44:38,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:44:38,986 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:44:38,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:44:38,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 20:44:38,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:38,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:38,989 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:44:38,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:44:38,999 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 15#L15-2true [2019-11-15 20:44:38,999 INFO L793 eck$LassoCheckResult]: Loop: 15#L15-2true assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 5#L18-2true assume !(main_~j~0 < main_~a~0); 3#L18-3true main_~i~0 := 1 + main_~i~0; 15#L15-2true [2019-11-15 20:44:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 20:44:39,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:39,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003765935] [2019-11-15 20:44:39,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:39,123 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash 39990, now seen corresponding path program 1 times [2019-11-15 20:44:39,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:39,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618800193] [2019-11-15 20:44:39,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:39,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash 963511, now seen corresponding path program 1 times [2019-11-15 20:44:39,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:39,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072666742] [2019-11-15 20:44:39,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:39,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:39,228 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 20:44:39,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072666742] [2019-11-15 20:44:39,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:39,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:44:39,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213259941] [2019-11-15 20:44:39,315 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:44:39,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:44:39,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:44:39,316 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:44:39,316 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:44:39,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:44:39,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:44:39,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:44:39,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2019-11-15 20:44:39,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:44:39,317 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:44:39,339 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 20:44:39,347 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 20:44:39,351 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 20:44:39,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:44:39,492 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 20:44:39,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:44:39,513 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 20:44:39,536 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:44:39,536 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 20:44:39,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:44:39,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:44:39,632 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:44:39,632 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_6ab7412a-c1da-47e4-8448-69fbd4301cda/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 20:44:39,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:44:39,652 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:44:39,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:44:39,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:44:40,097 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:44:40,099 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:44:40,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:44:40,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:44:40,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:44:40,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:44:40,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:44:40,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:44:40,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:44:40,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2019-11-15 20:44:40,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:44:40,101 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:44:40,102 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 20:44:40,115 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 20:44:40,125 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 20:44:40,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:44:40,254 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:44:40,256 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 20:44:40,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:44:40,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:44:40,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:44:40,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:44:40,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:44:40,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:44:40,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:44:40,273 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 20:44:40,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:44:40,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:44:40,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:44:40,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:44:40,278 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:44:40,279 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:44:40,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:44:40,289 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 20:44:40,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:44:40,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:44:40,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:44:40,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:44:40,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:44:40,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:44:40,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:44:40,309 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:44:40,317 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:44:40,317 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:44:40,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:44:40,320 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:44:40,320 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:44:40,321 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 20:44:40,324 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:44:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:40,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:44:40,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:40,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:44:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:40,445 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 20:44:40,466 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 20:44:40,468 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-11-15 20:44:40,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 60 states and 102 transitions. Complement of second has 9 states. [2019-11-15 20:44:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:44:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:44:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2019-11-15 20:44:40,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-15 20:44:40,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:44:40,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 20:44:40,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:44:40,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 64 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-15 20:44:40,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:44:40,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 102 transitions. [2019-11-15 20:44:40,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-15 20:44:40,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 37 states and 54 transitions. [2019-11-15 20:44:40,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:44:40,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 20:44:40,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 54 transitions. [2019-11-15 20:44:40,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:44:40,629 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-11-15 20:44:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 54 transitions. [2019-11-15 20:44:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2019-11-15 20:44:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:44:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-11-15 20:44:40,662 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 20:44:40,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:44:40,667 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 4 states. [2019-11-15 20:44:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:40,717 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-15 20:44:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:40,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 49 transitions. [2019-11-15 20:44:40,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-15 20:44:40,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 18 states and 25 transitions. [2019-11-15 20:44:40,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:44:40,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:44:40,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 20:44:40,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:44:40,723 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:44:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 20:44:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2019-11-15 20:44:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 20:44:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-15 20:44:40,725 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 20:44:40,725 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 20:44:40,725 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:44:40,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-15 20:44:40,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 20:44:40,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:40,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:40,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:44:40,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:44:40,727 INFO L791 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 181#L15-2 [2019-11-15 20:44:40,728 INFO L793 eck$LassoCheckResult]: Loop: 181#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 186#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 187#L20-2 assume !(main_~k~0 >= 0); 189#L20-3 main_~j~0 := 1 + main_~j~0; 190#L18-2 assume !(main_~j~0 < main_~a~0); 180#L18-3 main_~i~0 := 1 + main_~i~0; 181#L15-2 [2019-11-15 20:44:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 20:44:40,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:40,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735119378] [2019-11-15 20:44:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:40,736 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:40,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1192172983, now seen corresponding path program 1 times [2019-11-15 20:44:40,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:40,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887944165] [2019-11-15 20:44:40,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:40,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887944165] [2019-11-15 20:44:40,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:40,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:44:40,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498781114] [2019-11-15 20:44:40,772 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:44:40,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:44:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:44:40,773 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 20:44:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:40,821 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-11-15 20:44:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:44:40,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-11-15 20:44:40,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-15 20:44:40,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 20:44:40,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 20:44:40,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:44:40,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-15 20:44:40,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:44:40,825 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 20:44:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-15 20:44:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-11-15 20:44:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:44:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 20:44:40,827 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:44:40,827 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:44:40,827 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:44:40,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 20:44:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 20:44:40,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:40,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:40,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:44:40,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:40,829 INFO L791 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 218#L15-2 [2019-11-15 20:44:40,829 INFO L793 eck$LassoCheckResult]: Loop: 218#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 223#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 224#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 219#L23-2 assume !(main_~l~0 < main_~b~0); 220#L23-3 main_~k~0 := main_~k~0 - 1; 228#L20-2 assume !(main_~k~0 >= 0); 226#L20-3 main_~j~0 := 1 + main_~j~0; 227#L18-2 assume !(main_~j~0 < main_~a~0); 217#L18-3 main_~i~0 := 1 + main_~i~0; 218#L15-2 [2019-11-15 20:44:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 20:44:40,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:40,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18826730] [2019-11-15 20:44:40,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:40,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2090456946, now seen corresponding path program 1 times [2019-11-15 20:44:40,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:40,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917640683] [2019-11-15 20:44:40,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:40,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:40,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917640683] [2019-11-15 20:44:40,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:40,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:44:40,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044164825] [2019-11-15 20:44:40,911 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:44:40,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:40,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:44:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:44:40,912 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 20:44:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:41,006 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2019-11-15 20:44:41,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:44:41,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-15 20:44:41,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 20:44:41,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 20:44:41,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:44:41,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:44:41,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-11-15 20:44:41,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:44:41,009 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 20:44:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-11-15 20:44:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-11-15 20:44:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 20:44:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 20:44:41,011 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 20:44:41,012 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 20:44:41,012 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:44:41,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 20:44:41,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 20:44:41,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:41,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:41,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 20:44:41,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:44:41,013 INFO L791 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 258#L15-2 [2019-11-15 20:44:41,014 INFO L793 eck$LassoCheckResult]: Loop: 258#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 262#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 263#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 259#L23-2 assume !!(main_~l~0 < main_~b~0);main_~m~0 := 1000 + (main_~i~0 + main_~j~0 + main_~k~0 + main_~l~0); 260#L25-2 assume !(main_~m~0 >= 0); 264#L25-3 main_~l~0 := 1 + main_~l~0; 265#L23-2 assume !(main_~l~0 < main_~b~0); 268#L23-3 main_~k~0 := main_~k~0 - 1; 269#L20-2 assume !(main_~k~0 >= 0); 266#L20-3 main_~j~0 := 1 + main_~j~0; 267#L18-2 assume !(main_~j~0 < main_~a~0); 257#L18-3 main_~i~0 := 1 + main_~i~0; 258#L15-2 [2019-11-15 20:44:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-15 20:44:41,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499548491] [2019-11-15 20:44:41,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,039 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash -591153991, now seen corresponding path program 1 times [2019-11-15 20:44:41,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015411629] [2019-11-15 20:44:41,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:41,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015411629] [2019-11-15 20:44:41,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:44:41,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:44:41,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154139968] [2019-11-15 20:44:41,120 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:44:41,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:44:41,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:44:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:44:41,121 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 20:44:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:44:41,195 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-11-15 20:44:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:44:41,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 6 transitions. [2019-11-15 20:44:41,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 20:44:41,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 6 transitions. [2019-11-15 20:44:41,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 20:44:41,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 20:44:41,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-11-15 20:44:41,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:44:41,198 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 20:44:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-11-15 20:44:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-15 20:44:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 20:44:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-11-15 20:44:41,199 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 20:44:41,199 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-11-15 20:44:41,199 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:44:41,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-11-15 20:44:41,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 20:44:41,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:44:41,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:44:41,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:44:41,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 20:44:41,202 INFO L791 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0, main_~l~0, main_~m~0, main_~a~0, main_~b~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~l~0;havoc main_~m~0;havoc main_~a~0;havoc main_~b~0;main_~i~0 := 0; 294#L15-2 assume !!(main_~i~0 < 100);main_~a~0 := 2 + main_~i~0;main_~j~0 := 0; 295#L18-2 assume !!(main_~j~0 < main_~a~0);main_~k~0 := 3 + (main_~i~0 + main_~j~0); 296#L20-2 assume !!(main_~k~0 >= 0);main_~b~0 := 4 + (main_~i~0 + main_~j~0 + main_~k~0);main_~l~0 := 0; 291#L23-2 assume !!(main_~l~0 < main_~b~0);main_~m~0 := 1000 + (main_~i~0 + main_~j~0 + main_~k~0 + main_~l~0); 292#L25-2 [2019-11-15 20:44:41,202 INFO L793 eck$LassoCheckResult]: Loop: 292#L25-2 assume !!(main_~m~0 >= 0);main_~m~0 := main_~m~0 - 0; 292#L25-2 [2019-11-15 20:44:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 29869746, now seen corresponding path program 1 times [2019-11-15 20:44:41,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78776433] [2019-11-15 20:44:41,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2019-11-15 20:44:41,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776848034] [2019-11-15 20:44:41,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,248 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash 925962172, now seen corresponding path program 1 times [2019-11-15 20:44:41,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:44:41,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084550314] [2019-11-15 20:44:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:44:41,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:44:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:44:41,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:44:41,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:44:41 BoogieIcfgContainer [2019-11-15 20:44:41,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:44:41,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:44:41,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:44:41,414 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:44:41,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:44:38" (3/4) ... [2019-11-15 20:44:41,417 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:44:41,466 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ab7412a-c1da-47e4-8448-69fbd4301cda/bin/uautomizer/witness.graphml [2019-11-15 20:44:41,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:44:41,468 INFO L168 Benchmark]: Toolchain (without parser) took 3458.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 950.1 MB in the beginning and 968.4 MB in the end (delta: -18.4 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:44:41,469 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:44:41,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:44:41,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.17 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 20:44:41,471 INFO L168 Benchmark]: Boogie Preprocessor took 22.43 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:44:41,472 INFO L168 Benchmark]: RCFGBuilder took 412.73 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: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:44:41,473 INFO L168 Benchmark]: BuchiAutomizer took 2545.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.4 MB in the end (delta: 157.8 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:44:41,473 INFO L168 Benchmark]: Witness Printer took 52.80 ms. Allocated memory is still 1.2 GB. Free memory is still 968.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:44:41,476 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.17 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 22.43 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 412.73 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: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2545.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.4 MB in the end (delta: 157.8 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. * Witness Printer took 52.80 ms. Allocated memory is still 1.2 GB. Free memory is still 968.4 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 111 SDslu, 45 SDs, 0 SdLazy, 97 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax163 hnf96 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf91 smp100 dnf100 smp100 tf106 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {a=2, \result=0, b=7, m=1003, l=0, i=0, k=3, j=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 [L18] COND TRUE j < a [L19] k = i+j+3 [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...