./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.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_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 b10c0555613e3e1e99ee574b69e31152fe0aa7f9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:02:45,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:02:45,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:02:45,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:02:45,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:02:45,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:02:45,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:02:45,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:02:45,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:02:45,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:02:45,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:02:45,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:02:45,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:02:45,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:02:45,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:02:45,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:02:45,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:02:45,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:02:45,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:02:45,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:02:45,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:02:45,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:02:45,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:02:45,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:02:45,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:02:45,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:02:45,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:02:45,045 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:02:45,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:02:45,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:02:45,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:02:45,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:02:45,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:02:45,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:02:45,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:02:45,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:02:45,049 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:02:45,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:02:45,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:02:45,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:02:45,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:02:45,063 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:02:45,064 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:02:45,064 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:02:45,064 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:02:45,064 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:02:45,064 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:02:45,065 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:02:45,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:02:45,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:02:45,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:02:45,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:02:45,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:02:45,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:02:45,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:02:45,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:02:45,066 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:02:45,067 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:02:45,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:02:45,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:02:45,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:02:45,069 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:02:45,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:02:45,069 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:02:45,069 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:02:45,070 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:02:45,070 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_af8c5138-8132-4853-8da4-81b63a40eebf/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 -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2018-11-18 15:02:45,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:02:45,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:02:45,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:02:45,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:02:45,131 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:02:45,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-18 15:02:45,189 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/data/1f1a071db/fee3e6a9655f41eaa9daad89b3af8d78/FLAG22431d8e4 [2018-11-18 15:02:45,525 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:02:45,526 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-18 15:02:45,529 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/data/1f1a071db/fee3e6a9655f41eaa9daad89b3af8d78/FLAG22431d8e4 [2018-11-18 15:02:45,957 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/data/1f1a071db/fee3e6a9655f41eaa9daad89b3af8d78 [2018-11-18 15:02:45,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:02:45,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:02:45,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:02:45,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:02:45,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:02:45,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:02:45" (1/1) ... [2018-11-18 15:02:45,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ecdaec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:45, skipping insertion in model container [2018-11-18 15:02:45,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:02:45" (1/1) ... [2018-11-18 15:02:45,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:02:45,982 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:02:46,087 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:02:46,090 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:02:46,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:02:46,112 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:02:46,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46 WrapperNode [2018-11-18 15:02:46,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:02:46,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:02:46,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:02:46,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:02:46,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:02:46,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:02:46,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:02:46,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:02:46,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... [2018-11-18 15:02:46,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:02:46,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:02:46,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:02:46,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:02:46,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:02:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:02:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:02:46,329 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:02:46,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:02:46 BoogieIcfgContainer [2018-11-18 15:02:46,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:02:46,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:02:46,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:02:46,332 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:02:46,333 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:02:46,333 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:02:45" (1/3) ... [2018-11-18 15:02:46,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279cbb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:02:46, skipping insertion in model container [2018-11-18 15:02:46,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:02:46,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:02:46" (2/3) ... [2018-11-18 15:02:46,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@279cbb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:02:46, skipping insertion in model container [2018-11-18 15:02:46,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:02:46,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:02:46" (3/3) ... [2018-11-18 15:02:46,336 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_true-no-overflow_false-termination.c [2018-11-18 15:02:46,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:02:46,365 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:02:46,365 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:02:46,365 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:02:46,366 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:02:46,366 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:02:46,366 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:02:46,366 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:02:46,366 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:02:46,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 15:02:46,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 15:02:46,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:46,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:46,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:02:46,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:02:46,393 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:02:46,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 15:02:46,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 15:02:46,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:46,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:46,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:02:46,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 15:02:46,399 INFO L794 eck$LassoCheckResult]: Stem: 9#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 15:02:46,399 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 15:02:46,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:02:46,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:46,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 15:02:46,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:46,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:46,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 15:02:46,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:46,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:46,638 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:02:46,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:02:46,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:02:46,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:02:46,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:02:46,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:02:46,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:02:46,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:02:46,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_true-no-overflow_false-termination.c_Iteration1_Lasso [2018-11-18 15:02:46,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:02:46,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:02:46,660 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 15:02:46,665 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 15:02:46,666 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 15:02:46,668 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 15:02:46,671 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 15:02:46,676 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 15:02:46,677 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 15:02:46,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:02:46,717 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 15:02:46,719 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 15:02:46,853 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:02:46,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:02:46,859 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 15:02:46,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:02:46,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:02:46,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:02:46,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,865 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 15:02:46,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:02:46,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:02:46,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:02:46,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,868 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 15:02:46,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:02:46,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:02:46,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:02:46,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,870 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 15:02:46,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:02:46,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:02:46,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:02:46,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,873 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 15:02:46,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:02:46,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:02:46,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,882 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 15:02:46,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:02:46,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:02:46,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:02:46,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,884 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 15:02:46,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:02:46,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:02:46,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:02:46,900 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 15:02:46,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:02:46,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:02:46,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:02:46,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:02:46,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:02:46,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:02:46,926 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:02:46,937 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:02:46,937 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:02:46,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:02:46,941 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:02:46,941 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:02:46,941 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 15:02:46,948 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 15:02:46,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,030 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 15:02:47,044 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 15:02:47,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-18 15:02:47,108 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 15:02:47,108 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 15:02:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:02:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 15:02:47,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 15:02:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:02:47,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 15:02:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:02:47,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 15:02:47,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:02:47,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-18 15:02:47,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 14 transitions. [2018-11-18 15:02:47,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 15:02:47,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:47,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 15:02:47,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:47,118 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 15:02:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 15:02:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 15:02:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 15:02:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 15:02:47,136 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 15:02:47,136 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 15:02:47,136 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:02:47,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 15:02:47,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:47,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:47,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 15:02:47,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:47,137 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 15:02:47,137 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 99#L17-5 [2018-11-18 15:02:47,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2018-11-18 15:02:47,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,164 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 15:02:47,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:02:47,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:02:47,167 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:47,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 1 times [2018-11-18 15:02:47,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:02:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:02:47,283 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 15:02:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:47,291 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 15:02:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:02:47,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 15:02:47,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2018-11-18 15:02:47,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:47,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:47,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-18 15:02:47,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:47,293 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-18 15:02:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-18 15:02:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-18 15:02:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 15:02:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 15:02:47,294 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 15:02:47,294 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 15:02:47,294 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:02:47,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 15:02:47,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:47,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:47,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-18 15:02:47,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:47,295 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 15:02:47,295 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 131#L17-5 [2018-11-18 15:02:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1805950152, now seen corresponding path program 1 times [2018-11-18 15:02:47,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,312 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 15:02:47,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:47,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,334 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 15:02:47,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:47,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-18 15:02:47,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:47,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 2 times [2018-11-18 15:02:47,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:47,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:02:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:02:47,432 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-18 15:02:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:47,443 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-18 15:02:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:02:47,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-18 15:02:47,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 18 transitions. [2018-11-18 15:02:47,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:47,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:47,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-18 15:02:47,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:47,445 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-18 15:02:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-18 15:02:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-18 15:02:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 15:02:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-18 15:02:47,447 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 15:02:47,447 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 15:02:47,447 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:02:47,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-18 15:02:47,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:47,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:47,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2018-11-18 15:02:47,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:47,449 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 15:02:47,449 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 185#L17-5 [2018-11-18 15:02:47,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1994266490, now seen corresponding path program 2 times [2018-11-18 15:02:47,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,473 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 15:02:47,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:47,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:47,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:02:47,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:02:47,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:47,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,495 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 15:02:47,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:47,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 15:02:47,515 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:47,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 3 times [2018-11-18 15:02:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:02:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:02:47,608 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 15:02:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:47,624 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-18 15:02:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:02:47,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-18 15:02:47,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2018-11-18 15:02:47,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:47,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:47,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-18 15:02:47,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:47,626 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-18 15:02:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-18 15:02:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 15:02:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 15:02:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 15:02:47,628 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 15:02:47,628 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 15:02:47,629 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:02:47,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 15:02:47,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:47,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:47,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2018-11-18 15:02:47,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:47,630 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 15:02:47,630 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 255#L17-5 [2018-11-18 15:02:47,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1089674248, now seen corresponding path program 3 times [2018-11-18 15:02:47,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,662 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 15:02:47,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:47,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:47,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:02:47,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 15:02:47,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:47,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,702 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 15:02:47,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 15:02:47,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:47,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 4 times [2018-11-18 15:02:47,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:02:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:02:47,805 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-18 15:02:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:47,818 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 15:02:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:02:47,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-18 15:02:47,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2018-11-18 15:02:47,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:47,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:47,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-11-18 15:02:47,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:47,820 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 15:02:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-11-18 15:02:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-18 15:02:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 15:02:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-18 15:02:47,822 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 15:02:47,822 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 15:02:47,822 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:02:47,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-18 15:02:47,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:47,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:47,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:47,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2018-11-18 15:02:47,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:47,823 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 15:02:47,823 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 341#L17-5 [2018-11-18 15:02:47,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1122771270, now seen corresponding path program 4 times [2018-11-18 15:02:47,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:47,868 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 15:02:47,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:47,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:02:47,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:02:47,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:47,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:47,894 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 15:02:47,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:47,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 15:02:47,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:47,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 5 times [2018-11-18 15:02:47,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:47,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:47,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:02:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:02:48,000 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-18 15:02:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:48,016 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-18 15:02:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:02:48,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-18 15:02:48,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2018-11-18 15:02:48,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:48,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:48,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-18 15:02:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:48,017 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-18 15:02:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-18 15:02:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-18 15:02:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 15:02:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 15:02:48,018 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 15:02:48,018 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 15:02:48,018 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:02:48,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-18 15:02:48,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:48,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:48,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2018-11-18 15:02:48,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:48,019 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 15:02:48,020 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 443#L17-5 [2018-11-18 15:02:48,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash -726324408, now seen corresponding path program 5 times [2018-11-18 15:02:48,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,068 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 15:02:48,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:48,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:48,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 15:02:48,090 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 15:02:48,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:48,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:48,103 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 15:02:48,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:48,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 15:02:48,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:48,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 6 times [2018-11-18 15:02:48,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:02:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:02:48,180 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-18 15:02:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:48,195 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-18 15:02:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:02:48,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-11-18 15:02:48,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 30 transitions. [2018-11-18 15:02:48,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:48,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:48,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2018-11-18 15:02:48,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:48,197 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-18 15:02:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2018-11-18 15:02:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-18 15:02:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 15:02:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 15:02:48,199 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 15:02:48,199 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 15:02:48,199 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:02:48,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-18 15:02:48,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:48,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:48,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2018-11-18 15:02:48,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:48,200 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 15:02:48,200 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 561#L17-5 [2018-11-18 15:02:48,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 114870790, now seen corresponding path program 6 times [2018-11-18 15:02:48,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,242 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 15:02:48,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:48,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:48,248 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 15:02:48,265 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 15:02:48,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:48,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:48,284 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 15:02:48,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:48,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 15:02:48,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:48,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 7 times [2018-11-18 15:02:48,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:02:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:02:48,351 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-18 15:02:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:48,371 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-18 15:02:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:02:48,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-18 15:02:48,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 33 transitions. [2018-11-18 15:02:48,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:48,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:48,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-18 15:02:48,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:48,372 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 15:02:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-18 15:02:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 15:02:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:02:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 15:02:48,374 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 15:02:48,374 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 15:02:48,374 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:02:48,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-18 15:02:48,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:48,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:48,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2018-11-18 15:02:48,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:48,375 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 15:02:48,375 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 695#L17-5 [2018-11-18 15:02:48,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash -973157752, now seen corresponding path program 7 times [2018-11-18 15:02:48,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,435 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 15:02:48,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:48,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:48,480 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 15:02:48,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:48,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 15:02:48,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:48,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 8 times [2018-11-18 15:02:48,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:02:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:02:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:02:48,560 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-18 15:02:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:48,581 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 15:02:48,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:02:48,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-18 15:02:48,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 36 transitions. [2018-11-18 15:02:48,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:48,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:48,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 36 transitions. [2018-11-18 15:02:48,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:48,583 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-18 15:02:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 36 transitions. [2018-11-18 15:02:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 15:02:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 15:02:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-18 15:02:48,585 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 15:02:48,585 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 15:02:48,585 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:02:48,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2018-11-18 15:02:48,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:48,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:48,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2018-11-18 15:02:48,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:48,587 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 15:02:48,587 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 845#L17-5 [2018-11-18 15:02:48,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash -313269562, now seen corresponding path program 8 times [2018-11-18 15:02:48,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,664 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 15:02:48,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:48,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:02:48,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:02:48,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:48,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:48,690 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 15:02:48,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:48,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 15:02:48,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:48,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 9 times [2018-11-18 15:02:48,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:02:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:02:48,790 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-18 15:02:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:48,813 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-18 15:02:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:02:48,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-11-18 15:02:48,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 37 states and 39 transitions. [2018-11-18 15:02:48,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:48,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:48,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 39 transitions. [2018-11-18 15:02:48,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:48,816 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-18 15:02:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 39 transitions. [2018-11-18 15:02:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-18 15:02:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 15:02:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-18 15:02:48,818 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 15:02:48,818 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 15:02:48,818 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:02:48,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2018-11-18 15:02:48,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:48,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:48,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:48,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2018-11-18 15:02:48,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:48,820 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 15:02:48,820 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1011#L17-5 [2018-11-18 15:02:48,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash 350484936, now seen corresponding path program 9 times [2018-11-18 15:02:48,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:48,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:02:48,902 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 15:02:48,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:02:48,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/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 15:02:48,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:02:48,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 15:02:48,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:02:48,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:02:48,992 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 15:02:49,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:02:49,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 15:02:49,009 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:02:49,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 10 times [2018-11-18 15:02:49,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:49,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:02:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:02:49,072 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand 13 states. [2018-11-18 15:02:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:02:49,104 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-18 15:02:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:02:49,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 42 transitions. [2018-11-18 15:02:49,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:49,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 41 transitions. [2018-11-18 15:02:49,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 15:02:49,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 15:02:49,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-18 15:02:49,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:02:49,106 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 15:02:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-18 15:02:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 15:02:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 15:02:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-18 15:02:49,108 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 15:02:49,108 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 15:02:49,108 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 15:02:49,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 40 transitions. [2018-11-18 15:02:49,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:02:49,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:02:49,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:02:49,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2018-11-18 15:02:49,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:02:49,109 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 15:02:49,109 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~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1192#L17-5 [2018-11-18 15:02:49,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 231304070, now seen corresponding path program 10 times [2018-11-18 15:02:49,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:49,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1510507, now seen corresponding path program 11 times [2018-11-18 15:02:49,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:49,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:02:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash -326816400, now seen corresponding path program 1 times [2018-11-18 15:02:49,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:02:49,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:02:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:02:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:02:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:02:51,572 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 186 DAG size of output: 142 [2018-11-18 15:02:51,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:02:51 BoogieIcfgContainer [2018-11-18 15:02:51,672 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:02:51,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:02:51,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:02:51,673 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:02:51,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:02:46" (3/4) ... [2018-11-18 15:02:51,676 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 15:02:51,711 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_af8c5138-8132-4853-8da4-81b63a40eebf/bin-2019/uautomizer/witness.graphml [2018-11-18 15:02:51,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:02:51,711 INFO L168 Benchmark]: Toolchain (without parser) took 5752.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:02:51,712 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:02:51,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:02:51,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.53 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 945.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:02:51,713 INFO L168 Benchmark]: Boogie Preprocessor took 12.69 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:02:51,713 INFO L168 Benchmark]: RCFGBuilder took 183.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:02:51,713 INFO L168 Benchmark]: BuchiAutomizer took 5342.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.0 MB). Peak memory consumption was 257.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:02:51,714 INFO L168 Benchmark]: Witness Printer took 38.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: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:02:51,717 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.8 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 19.53 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 945.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.69 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 183.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5342.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.0 MB). Peak memory consumption was 257.2 MB. Max. memory is 11.5 GB. * Witness Printer took 38.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: 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.3s and 12 iterations. TraceHistogramMax:11. Analysis of lassos took 4.8s. 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: 8ms 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@73416672=0, NULL=0, \result=0, n=10, i=7, a=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19fb9b2c=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3374f8ed=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e628d4a=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@128bf507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@104d9291=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] FCALL a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...