./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:52,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:52,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:52,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:52,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:52,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:52,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:52,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:52,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:52,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:52,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:52,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:52,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:52,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:52,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:52,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:52,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:52,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:52,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:52,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:52,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:52,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:52,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:52,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:52,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:52,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:52,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:52,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:52,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:52,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:52,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:52,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:52,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:52,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:52,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:52,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:52,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:52,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:52,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:52,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:52,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:52,115 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:52,115 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:52,115 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:52,115 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:52,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:52,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:52,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:52,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:52,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:52,118 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:52,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:52,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:52,118 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:52,119 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:52,119 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2018-11-18 08:34:52,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:52,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:52,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:52,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:52,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:52,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2018-11-18 08:34:52,197 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/data/61f02a2a9/2ec406b7ca7444bbbb6cd925dd319cef/FLAGfa8c53d41 [2018-11-18 08:34:52,620 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:52,620 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2018-11-18 08:34:52,625 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/data/61f02a2a9/2ec406b7ca7444bbbb6cd925dd319cef/FLAGfa8c53d41 [2018-11-18 08:34:52,637 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/data/61f02a2a9/2ec406b7ca7444bbbb6cd925dd319cef [2018-11-18 08:34:52,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:52,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:52,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:52,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:52,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:52,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dff18a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52, skipping insertion in model container [2018-11-18 08:34:52,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:52,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:52,804 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:52,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:52,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:52,832 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:52,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52 WrapperNode [2018-11-18 08:34:52,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:52,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:52,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:52,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:52,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:52,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:52,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:52,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:52,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... [2018-11-18 08:34:52,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:52,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:52,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:52,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:52,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:53,048 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:53,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:53 BoogieIcfgContainer [2018-11-18 08:34:53,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:53,049 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:53,049 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:53,052 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:53,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:53,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:52" (1/3) ... [2018-11-18 08:34:53,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e990263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:53, skipping insertion in model container [2018-11-18 08:34:53,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:53,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:52" (2/3) ... [2018-11-18 08:34:53,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e990263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:53, skipping insertion in model container [2018-11-18 08:34:53,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:53,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:53" (3/3) ... [2018-11-18 08:34:53,056 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_false-termination_false-valid-deref.c [2018-11-18 08:34:53,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:53,103 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:53,103 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:53,103 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:53,103 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:53,103 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:53,103 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:53,103 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:53,103 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:53,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 08:34:53,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:53,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,138 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:53,138 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:53,138 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:53,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 08:34:53,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:53,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:53,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:53,148 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 5#L13-4true [2018-11-18 08:34:53,148 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-4true assume true; 11#L13-1true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 7#L13-3true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-4true [2018-11-18 08:34:53,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:34:53,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,219 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 08:34:53,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,235 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 08:34:53,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,387 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:53,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:53,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:53,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:53,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:53,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:53,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:53,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:53,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_false-termination_false-valid-deref.c_Iteration1_Lasso [2018-11-18 08:34:53,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:53,389 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:53,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:53,624 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:53,629 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:53,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:53,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:53,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:53,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:53,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:53,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:53,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:53,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:53,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:53,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:53,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:53,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:53,714 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:34:53,714 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 08:34:53,716 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:53,717 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:53,717 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:53,718 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2018-11-18 08:34:53,722 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 08:34:53,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:53,806 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:34:53,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-18 08:34:53,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-11-18 08:34:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 08:34:53,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 08:34:53,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 08:34:53,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 08:34:53,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:53,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-18 08:34:53,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:53,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 14 transitions. [2018-11-18 08:34:53,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 08:34:53,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:53,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 08:34:53,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:53,869 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 08:34:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 08:34:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 08:34:53,891 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:53,892 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:53,892 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:53,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 08:34:53,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:53,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 08:34:53,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:53,893 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 91#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 92#L13-4 assume true; 100#L13-1 assume !(main_~n~0 < 10); 99#L17-5 [2018-11-18 08:34:53,893 INFO L796 eck$LassoCheckResult]: Loop: 99#L17-5 assume true; 98#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 96#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 97#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 99#L17-5 [2018-11-18 08:34:53,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2018-11-18 08:34:53,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:53,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:53,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:34:53,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:53,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 1 times [2018-11-18 08:34:53,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,046 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 08:34:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,055 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 08:34:54,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 08:34:54,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-11-18 08:34:54,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:54,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:54,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-18 08:34:54,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,058 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-18 08:34:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-18 08:34:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-18 08:34:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 08:34:54,059 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:54,059 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:54,059 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:54,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 08:34:54,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,060 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 123#L13-4 assume true; 132#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 124#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 125#L13-4 assume true; 130#L13-1 assume !(main_~n~0 < 10); 131#L17-5 [2018-11-18 08:34:54,060 INFO L796 eck$LassoCheckResult]: Loop: 131#L17-5 assume true; 129#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 127#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 128#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 131#L17-5 [2018-11-18 08:34:54,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1805950152, now seen corresponding path program 1 times [2018-11-18 08:34:54,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:54,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:54,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-18 08:34:54,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:54,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 2 times [2018-11-18 08:34:54,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:34:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:34:54,234 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-18 08:34:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,245 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-18 08:34:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:54,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-18 08:34:54,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 18 transitions. [2018-11-18 08:34:54,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:54,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:54,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-18 08:34:54,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,248 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 08:34:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-18 08:34:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-18 08:34:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 08:34:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-18 08:34:54,250 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 08:34:54,250 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 08:34:54,250 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:54,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-18 08:34:54,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2018-11-18 08:34:54,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,252 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 177#L13-4 assume true; 188#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 178#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 179#L13-4 assume true; 186#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 187#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 189#L13-4 assume true; 184#L13-1 assume !(main_~n~0 < 10); 185#L17-5 [2018-11-18 08:34:54,252 INFO L796 eck$LassoCheckResult]: Loop: 185#L17-5 assume true; 183#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 180#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 181#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 185#L17-5 [2018-11-18 08:34:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1994266490, now seen corresponding path program 2 times [2018-11-18 08:34:54,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:54,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:54,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:54,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:54,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:54,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 08:34:54,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 3 times [2018-11-18 08:34:54,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:34:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:34:54,428 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 08:34:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,450 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-18 08:34:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:34:54,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-18 08:34:54,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2018-11-18 08:34:54,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:54,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:54,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-18 08:34:54,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,453 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 08:34:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-18 08:34:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 08:34:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 08:34:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 08:34:54,455 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 08:34:54,455 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 08:34:54,455 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:54,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 08:34:54,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,456 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2018-11-18 08:34:54,456 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,457 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 247#L13-4 assume true; 257#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 262#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 258#L13-4 assume true; 256#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 248#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 249#L13-4 assume true; 260#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 259#L13-4 assume true; 254#L13-1 assume !(main_~n~0 < 10); 255#L17-5 [2018-11-18 08:34:54,457 INFO L796 eck$LassoCheckResult]: Loop: 255#L17-5 assume true; 253#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 251#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 252#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 255#L17-5 [2018-11-18 08:34:54,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1089674248, now seen corresponding path program 3 times [2018-11-18 08:34:54,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:54,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:54,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:34:54,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 08:34:54,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:54,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 08:34:54,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:54,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 4 times [2018-11-18 08:34:54,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:34:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:34:54,621 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-18 08:34:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,637 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 08:34:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:34:54,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-18 08:34:54,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2018-11-18 08:34:54,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:54,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:54,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-18 08:34:54,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,639 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 08:34:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-18 08:34:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-18 08:34:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 08:34:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-18 08:34:54,640 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 08:34:54,640 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 08:34:54,640 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:54,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-18 08:34:54,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2018-11-18 08:34:54,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,642 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 333#L13-4 assume true; 342#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 334#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-4 assume true; 343#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 351#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 350#L13-4 assume true; 349#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 348#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 347#L13-4 assume true; 345#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 346#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 344#L13-4 assume true; 340#L13-1 assume !(main_~n~0 < 10); 341#L17-5 [2018-11-18 08:34:54,642 INFO L796 eck$LassoCheckResult]: Loop: 341#L17-5 assume true; 339#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 337#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 341#L17-5 [2018-11-18 08:34:54,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1122771270, now seen corresponding path program 4 times [2018-11-18 08:34:54,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:54,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:54,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 08:34:54,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 08:34:54,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:54,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 08:34:54,731 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:54,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 5 times [2018-11-18 08:34:54,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:34:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:34:54,814 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 08:34:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,845 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-18 08:34:54,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:54,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-18 08:34:54,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2018-11-18 08:34:54,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:54,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:54,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-18 08:34:54,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:54,848 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-18 08:34:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-18 08:34:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-18 08:34:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 08:34:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 08:34:54,850 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 08:34:54,850 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 08:34:54,850 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:34:54,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-18 08:34:54,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:54,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2018-11-18 08:34:54,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,851 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 435#L13-4 assume true; 444#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 436#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 437#L13-4 assume true; 445#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 456#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 455#L13-4 assume true; 454#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 453#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 452#L13-4 assume true; 451#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 450#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 449#L13-4 assume true; 447#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 448#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 446#L13-4 assume true; 442#L13-1 assume !(main_~n~0 < 10); 443#L17-5 [2018-11-18 08:34:54,851 INFO L796 eck$LassoCheckResult]: Loop: 443#L17-5 assume true; 441#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 439#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 440#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 443#L17-5 [2018-11-18 08:34:54,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash -726324408, now seen corresponding path program 5 times [2018-11-18 08:34:54,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:54,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:54,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 08:34:54,928 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 08:34:54,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:54,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:54,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 08:34:54,975 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:54,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 6 times [2018-11-18 08:34:54,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:34:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:34:55,054 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-18 08:34:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,072 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-18 08:34:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:34:55,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-11-18 08:34:55,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 30 transitions. [2018-11-18 08:34:55,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:55,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:55,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2018-11-18 08:34:55,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:55,075 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-18 08:34:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2018-11-18 08:34:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-18 08:34:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 08:34:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 08:34:55,078 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 08:34:55,078 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 08:34:55,078 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:34:55,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-18 08:34:55,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:55,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:55,079 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2018-11-18 08:34:55,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:55,080 INFO L794 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 553#L13-4 assume true; 562#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 554#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 555#L13-4 assume true; 563#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 577#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 576#L13-4 assume true; 575#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 574#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 573#L13-4 assume true; 572#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 571#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 570#L13-4 assume true; 569#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 568#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 567#L13-4 assume true; 565#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 566#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 564#L13-4 assume true; 560#L13-1 assume !(main_~n~0 < 10); 561#L17-5 [2018-11-18 08:34:55,080 INFO L796 eck$LassoCheckResult]: Loop: 561#L17-5 assume true; 559#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 557#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 558#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 561#L17-5 [2018-11-18 08:34:55,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 114870790, now seen corresponding path program 6 times [2018-11-18 08:34:55,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:55,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:55,138 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 08:34:55,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 08:34:55,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:55,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:55,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 08:34:55,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:55,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 7 times [2018-11-18 08:34:55,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:34:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:34:55,284 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-18 08:34:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,310 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-18 08:34:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:34:55,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-18 08:34:55,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 33 transitions. [2018-11-18 08:34:55,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:55,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:55,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-18 08:34:55,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:55,314 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 08:34:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-18 08:34:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 08:34:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 08:34:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 08:34:55,315 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 08:34:55,315 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 08:34:55,315 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 08:34:55,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-18 08:34:55,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:55,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:55,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2018-11-18 08:34:55,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:55,317 INFO L794 eck$LassoCheckResult]: Stem: 690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 687#L13-4 assume true; 696#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 688#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 689#L13-4 assume true; 697#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 714#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 713#L13-4 assume true; 712#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 711#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 710#L13-4 assume true; 709#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 708#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 707#L13-4 assume true; 706#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 705#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 704#L13-4 assume true; 703#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 702#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 701#L13-4 assume true; 699#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 700#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 698#L13-4 assume true; 694#L13-1 assume !(main_~n~0 < 10); 695#L17-5 [2018-11-18 08:34:55,317 INFO L796 eck$LassoCheckResult]: Loop: 695#L17-5 assume true; 693#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 691#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 692#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 695#L17-5 [2018-11-18 08:34:55,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash -973157752, now seen corresponding path program 7 times [2018-11-18 08:34:55,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:55,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:55,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 08:34:55,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:55,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 8 times [2018-11-18 08:34:55,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 08:34:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 08:34:55,511 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-18 08:34:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,528 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 08:34:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:34:55,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-18 08:34:55,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 36 transitions. [2018-11-18 08:34:55,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:55,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:55,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 36 transitions. [2018-11-18 08:34:55,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:55,530 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-18 08:34:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 36 transitions. [2018-11-18 08:34:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 08:34:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 08:34:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-18 08:34:55,532 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 08:34:55,532 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 08:34:55,532 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 08:34:55,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2018-11-18 08:34:55,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:55,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:55,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2018-11-18 08:34:55,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:55,533 INFO L794 eck$LassoCheckResult]: Stem: 842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 837#L13-4 assume true; 846#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 838#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 839#L13-4 assume true; 847#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 867#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 866#L13-4 assume true; 865#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-4 assume true; 862#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 861#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 860#L13-4 assume true; 859#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 858#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 857#L13-4 assume true; 856#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 854#L13-4 assume true; 853#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 852#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 851#L13-4 assume true; 849#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 850#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 848#L13-4 assume true; 844#L13-1 assume !(main_~n~0 < 10); 845#L17-5 [2018-11-18 08:34:55,533 INFO L796 eck$LassoCheckResult]: Loop: 845#L17-5 assume true; 843#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 840#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 841#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 845#L17-5 [2018-11-18 08:34:55,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -313269562, now seen corresponding path program 8 times [2018-11-18 08:34:55,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:55,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:55,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:55,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:55,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:55,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 08:34:55,655 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:55,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 9 times [2018-11-18 08:34:55,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:34:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:34:55,747 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-18 08:34:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:55,776 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-18 08:34:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 08:34:55,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-11-18 08:34:55,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 39 transitions. [2018-11-18 08:34:55,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:55,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:55,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 39 transitions. [2018-11-18 08:34:55,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:55,779 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 08:34:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 39 transitions. [2018-11-18 08:34:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-18 08:34:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 08:34:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-18 08:34:55,781 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 08:34:55,781 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 08:34:55,781 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 08:34:55,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2018-11-18 08:34:55,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:55,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:55,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:55,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2018-11-18 08:34:55,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:55,786 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1002#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 1003#L13-4 assume true; 1012#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1004#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1005#L13-4 assume true; 1013#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1036#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1035#L13-4 assume true; 1034#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1033#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1032#L13-4 assume true; 1031#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1030#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1029#L13-4 assume true; 1028#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1027#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1026#L13-4 assume true; 1025#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1024#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1023#L13-4 assume true; 1022#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1021#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1020#L13-4 assume true; 1019#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1018#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1017#L13-4 assume true; 1015#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1016#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1014#L13-4 assume true; 1010#L13-1 assume !(main_~n~0 < 10); 1011#L17-5 [2018-11-18 08:34:55,786 INFO L796 eck$LassoCheckResult]: Loop: 1011#L17-5 assume true; 1009#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1007#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 1008#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1011#L17-5 [2018-11-18 08:34:55,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash 350484936, now seen corresponding path program 9 times [2018-11-18 08:34:55,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:55,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:34:55,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 08:34:55,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:55,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:55,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 08:34:55,923 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:55,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 10 times [2018-11-18 08:34:55,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 08:34:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 08:34:55,991 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand 13 states. [2018-11-18 08:34:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:56,014 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-18 08:34:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 08:34:56,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 42 transitions. [2018-11-18 08:34:56,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:56,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 41 transitions. [2018-11-18 08:34:56,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 08:34:56,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 08:34:56,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-18 08:34:56,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:56,016 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 08:34:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-18 08:34:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 08:34:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 08:34:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-18 08:34:56,018 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 08:34:56,018 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 08:34:56,018 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 08:34:56,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 40 transitions. [2018-11-18 08:34:56,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:56,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:56,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:56,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2018-11-18 08:34:56,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:56,019 INFO L794 eck$LassoCheckResult]: Stem: 1189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 1184#L13-4 assume true; 1193#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1185#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1186#L13-4 assume true; 1194#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1220#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1219#L13-4 assume true; 1218#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1217#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1216#L13-4 assume true; 1215#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1214#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1213#L13-4 assume true; 1212#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1211#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1210#L13-4 assume true; 1209#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1208#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1207#L13-4 assume true; 1206#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1205#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1204#L13-4 assume true; 1203#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1202#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1201#L13-4 assume true; 1200#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1199#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1198#L13-4 assume true; 1196#L13-1 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 1197#L13-3 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 1195#L13-4 assume true; 1191#L13-1 assume !(main_~n~0 < 10); 1192#L17-5 [2018-11-18 08:34:56,020 INFO L796 eck$LassoCheckResult]: Loop: 1192#L17-5 assume true; 1190#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1187#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 1188#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 1192#L17-5 [2018-11-18 08:34:56,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 231304070, now seen corresponding path program 10 times [2018-11-18 08:34:56,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 11 times [2018-11-18 08:34:56,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash -326816400, now seen corresponding path program 1 times [2018-11-18 08:34:56,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:58,441 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 186 DAG size of output: 142 [2018-11-18 08:34:58,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:58 BoogieIcfgContainer [2018-11-18 08:34:58,547 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:58,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:58,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:58,547 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:58,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:53" (3/4) ... [2018-11-18 08:34:58,552 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 08:34:58,587 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e428a809-bb72-4bdc-b4b9-65aa9e04b79e/bin-2019/uautomizer/witness.graphml [2018-11-18 08:34:58,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:58,588 INFO L168 Benchmark]: Toolchain (without parser) took 5947.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,588 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,589 INFO L168 Benchmark]: Boogie Preprocessor took 51.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,589 INFO L168 Benchmark]: RCFGBuilder took 142.60 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,590 INFO L168 Benchmark]: BuchiAutomizer took 5497.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,590 INFO L168 Benchmark]: Witness Printer took 40.21 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: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,593 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 142.60 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5497.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 257.5 MB. Max. memory is 11.5 GB. * Witness Printer took 40.21 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: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 12 iterations. TraceHistogramMax:11. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 68 SDslu, 371 SDs, 0 SdLazy, 188 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp93 ukn58 mio100 lsp72 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@561857f8=0, NULL=0, \result=0, n=10, i=8, a=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54cb9584=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@73dfc129=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@420f6403=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7abd54f2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1e8f884f=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] FCALL int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR, FCALL a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] FCALL a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...