./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:40:17,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:40:17,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:40:17,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:40:17,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:40:17,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:40:17,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:40:17,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:40:17,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:40:17,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:40:17,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:40:17,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:40:17,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:40:17,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:40:17,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:40:17,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:40:17,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:40:17,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:40:17,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:40:17,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:40:17,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:40:17,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:40:17,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:40:17,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:40:17,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:40:17,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:40:17,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:40:17,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:40:17,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:40:17,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:40:17,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:40:17,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:40:17,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:40:17,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:40:17,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:40:17,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:40:17,177 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:40:17,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:40:17,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:40:17,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:40:17,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:40:17,189 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:40:17,190 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:40:17,190 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:40:17,190 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:40:17,190 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:40:17,190 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:40:17,190 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:40:17,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:40:17,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:40:17,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:40:17,192 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:40:17,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:40:17,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:40:17,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:40:17,192 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:40:17,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:40:17,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:40:17,193 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:40:17,193 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:40:17,194 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_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2018-11-10 11:40:17,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:40:17,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:40:17,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:40:17,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:40:17,230 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:40:17,230 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2018-11-10 11:40:17,267 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/data/ec2ea6e71/ed7d5620b959475eb90a1f9ea8a2ac3a/FLAG8185b3982 [2018-11-10 11:40:17,565 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:40:17,565 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/sv-benchmarks/c/termination-crafted/NonTermination3_false-termination_false-valid-deref.c [2018-11-10 11:40:17,569 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/data/ec2ea6e71/ed7d5620b959475eb90a1f9ea8a2ac3a/FLAG8185b3982 [2018-11-10 11:40:17,581 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/data/ec2ea6e71/ed7d5620b959475eb90a1f9ea8a2ac3a [2018-11-10 11:40:17,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:40:17,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:40:17,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:40:17,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:40:17,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:40:17,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e4a23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17, skipping insertion in model container [2018-11-10 11:40:17,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:40:17,605 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:40:17,704 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:40:17,706 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:40:17,717 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:40:17,728 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:40:17,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17 WrapperNode [2018-11-10 11:40:17,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:40:17,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:40:17,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:40:17,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:40:17,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:40:17,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:40:17,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:40:17,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:40:17,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... [2018-11-10 11:40:17,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:40:17,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:40:17,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:40:17,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:40:17,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:40:17,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:40:17,985 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:40:17,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:17 BoogieIcfgContainer [2018-11-10 11:40:17,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:40:17,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:40:17,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:40:17,989 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:40:17,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:40:17,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:40:17" (1/3) ... [2018-11-10 11:40:17,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11f9a4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:40:17, skipping insertion in model container [2018-11-10 11:40:17,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:40:17,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:40:17" (2/3) ... [2018-11-10 11:40:17,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11f9a4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:40:17, skipping insertion in model container [2018-11-10 11:40:17,992 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:40:17,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:17" (3/3) ... [2018-11-10 11:40:17,994 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_false-termination_false-valid-deref.c [2018-11-10 11:40:18,044 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:40:18,044 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:40:18,045 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:40:18,045 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:40:18,045 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:40:18,045 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:40:18,045 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:40:18,045 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:40:18,045 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:40:18,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 11:40:18,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 11:40:18,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:18,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:18,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:40:18,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:40:18,083 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:40:18,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 11:40:18,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 11:40:18,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:18,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:18,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:40:18,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:40:18,092 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 7#L13-4true [2018-11-10 11:40:18,093 INFO L795 eck$LassoCheckResult]: Loop: 7#L13-4true assume true; 14#L13-1true assume !!(main_~n~0 < 10); 19#L14true SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 17#L14-1true havoc main_#t~nondet2; 11#L13-3true main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 7#L13-4true [2018-11-10 11:40:18,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:40:18,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:18,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 11:40:18,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:18,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:18,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 11:40:18,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:18,347 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:40:18,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:40:18,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:40:18,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:40:18,348 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:40:18,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:40:18,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:40:18,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:40:18,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_false-termination_false-valid-deref.c_Iteration1_Lasso [2018-11-10 11:40:18,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:40:18,349 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:40:18,368 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-10 11:40:18,372 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-10 11:40:18,502 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-10 11:40:18,504 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-10 11:40:18,513 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-10 11:40:18,514 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-10 11:40:18,516 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-10 11:40:18,518 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-10 11:40:18,519 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-10 11:40:18,520 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-10 11:40:18,697 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:40:18,700 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:40:18,702 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-10 11:40:18,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:40:18,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:40:18,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:40:18,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,707 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-10 11:40:18,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:40:18,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,717 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-10 11:40:18,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:40:18,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:40:18,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:40:18,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,720 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-10 11:40:18,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:40:18,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,732 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-10 11:40:18,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:40:18,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:40:18,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,750 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-10 11:40:18,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:40:18,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,767 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-10 11:40:18,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:40:18,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,775 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-10 11:40:18,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:40:18,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:40:18,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:40:18,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:40:18,777 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-10 11:40:18,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:40:18,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:40:18,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:40:18,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:40:18,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:40:18,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:40:18,814 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:40:18,849 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:40:18,849 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 11:40:18,851 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:40:18,852 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:40:18,853 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:40:18,853 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2018-11-10 11:40:18,872 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 11:40:18,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:18,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:18,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:18,925 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-10 11:40:18,938 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-10 11:40:18,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 11:40:18,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 45 states and 55 transitions. Complement of second has 7 states. [2018-11-10 11:40:18,972 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-10 11:40:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:40:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-10 11:40:18,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 11:40:18,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:40:18,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 11:40:18,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:40:18,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 11:40:18,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:40:18,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2018-11-10 11:40:18,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:18,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 16 states and 19 transitions. [2018-11-10 11:40:18,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 11:40:18,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:18,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-10 11:40:18,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:18,982 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-10 11:40:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-10 11:40:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 11:40:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 11:40:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-10 11:40:19,000 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-10 11:40:19,001 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-10 11:40:19,001 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:40:19,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-10 11:40:19,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 11:40:19,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:40:19,002 INFO L793 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 129#L13-4 assume true; 131#L13-1 assume !(main_~n~0 < 10); 128#L20-1 [2018-11-10 11:40:19,002 INFO L795 eck$LassoCheckResult]: Loop: 128#L20-1 assume true; 127#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 125#L17-1 assume !main_#t~short4; 126#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 133#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 128#L20-1 [2018-11-10 11:40:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2018-11-10 11:40:19,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,031 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-10 11:40:19,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:19,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:40:19,033 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 48738268, now seen corresponding path program 1 times [2018-11-10 11:40:19,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,048 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-10 11:40:19,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:19,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:40:19,049 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:40:19,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:40:19,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:40:19,052 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 11:40:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:19,062 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-10 11:40:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:40:19,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-10 11:40:19,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2018-11-10 11:40:19,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:19,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:19,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-10 11:40:19,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:19,065 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 11:40:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-10 11:40:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-11-10 11:40:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 11:40:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 11:40:19,066 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 11:40:19,066 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 11:40:19,066 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:40:19,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 11:40:19,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:40:19,068 INFO L793 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 173#L13-4 assume true; 174#L13-1 assume !!(main_~n~0 < 10); 181#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 182#L14-1 havoc main_#t~nondet2; 179#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 175#L13-4 assume true; 176#L13-1 assume !(main_~n~0 < 10); 172#L20-1 [2018-11-10 11:40:19,068 INFO L795 eck$LassoCheckResult]: Loop: 172#L20-1 assume true; 171#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 169#L17-1 assume !main_#t~short4; 170#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 177#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 172#L20-1 [2018-11-10 11:40:19,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash 350599465, now seen corresponding path program 1 times [2018-11-10 11:40:19,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,098 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-10 11:40:19,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:19,099 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:19,125 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-10 11:40:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:19,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-10 11:40:19,141 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash 48738268, now seen corresponding path program 2 times [2018-11-10 11:40:19,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,152 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-10 11:40:19,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:40:19,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:40:19,153 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:40:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:40:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:40:19,154 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 11:40:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:19,166 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-10 11:40:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:40:19,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-10 11:40:19,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 17 transitions. [2018-11-10 11:40:19,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:19,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:19,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-10 11:40:19,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:19,168 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 11:40:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-10 11:40:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 11:40:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 11:40:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 11:40:19,170 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 11:40:19,170 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 11:40:19,170 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:40:19,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2018-11-10 11:40:19,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,171 INFO L793 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 238#L13-4 assume true; 239#L13-1 assume !!(main_~n~0 < 10); 246#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 248#L14-1 havoc main_#t~nondet2; 244#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 240#L13-4 assume true; 241#L13-1 assume !(main_~n~0 < 10); 237#L20-1 [2018-11-10 11:40:19,171 INFO L795 eck$LassoCheckResult]: Loop: 237#L20-1 assume true; 236#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 235#L17-1 assume main_#t~short4; 233#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 234#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 247#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 242#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 237#L20-1 [2018-11-10 11:40:19,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash 350599465, now seen corresponding path program 2 times [2018-11-10 11:40:19,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,187 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-10 11:40:19,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:19,187 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:19,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:40:19,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:40:19,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:19,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:19,227 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-10 11:40:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-10 11:40:19,254 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 1 times [2018-11-10 11:40:19,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:40:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:40:19,378 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 11:40:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:19,398 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-10 11:40:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:40:19,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2018-11-10 11:40:19,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 26 transitions. [2018-11-10 11:40:19,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:19,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:19,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 11:40:19,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:19,401 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 11:40:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 11:40:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-10 11:40:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 11:40:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 11:40:19,403 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 11:40:19,403 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 11:40:19,403 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:40:19,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-10 11:40:19,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1] [2018-11-10 11:40:19,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,404 INFO L793 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 312#L13-4 assume true; 313#L13-1 assume !!(main_~n~0 < 10); 327#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 326#L14-1 havoc main_#t~nondet2; 325#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 314#L13-4 assume true; 315#L13-1 assume !!(main_~n~0 < 10); 322#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 324#L14-1 havoc main_#t~nondet2; 318#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 319#L13-4 assume true; 321#L13-1 assume !(main_~n~0 < 10); 311#L20-1 [2018-11-10 11:40:19,404 INFO L795 eck$LassoCheckResult]: Loop: 311#L20-1 assume true; 310#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 309#L17-1 assume main_#t~short4; 307#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 308#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 323#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 316#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 311#L20-1 [2018-11-10 11:40:19,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 752190886, now seen corresponding path program 3 times [2018-11-10 11:40:19,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:19,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:19,430 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:19,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:40:19,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 11:40:19,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:19,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:19,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 11:40:19,474 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 2 times [2018-11-10 11:40:19,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:40:19,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:40:19,567 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 11:40:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:19,584 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-10 11:40:19,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:40:19,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2018-11-10 11:40:19,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 31 transitions. [2018-11-10 11:40:19,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:19,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:19,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 31 transitions. [2018-11-10 11:40:19,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:19,587 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-10 11:40:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 31 transitions. [2018-11-10 11:40:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-10 11:40:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 11:40:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-10 11:40:19,589 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 11:40:19,589 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-10 11:40:19,589 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:40:19,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2018-11-10 11:40:19,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1] [2018-11-10 11:40:19,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,591 INFO L793 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 412#L13-4 assume true; 413#L13-1 assume !!(main_~n~0 < 10); 432#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 431#L14-1 havoc main_#t~nondet2; 430#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 414#L13-4 assume true; 415#L13-1 assume !!(main_~n~0 < 10); 422#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 424#L14-1 havoc main_#t~nondet2; 418#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 419#L13-4 assume true; 426#L13-1 assume !!(main_~n~0 < 10); 429#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 428#L14-1 havoc main_#t~nondet2; 427#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 425#L13-4 assume true; 421#L13-1 assume !(main_~n~0 < 10); 411#L20-1 [2018-11-10 11:40:19,591 INFO L795 eck$LassoCheckResult]: Loop: 411#L20-1 assume true; 410#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 409#L17-1 assume main_#t~short4; 407#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 408#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 423#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 416#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 411#L20-1 [2018-11-10 11:40:19,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1540161719, now seen corresponding path program 4 times [2018-11-10 11:40:19,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:19,625 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:40:19,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:40:19,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:19,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:19,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 11:40:19,684 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 3 times [2018-11-10 11:40:19,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:40:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:40:19,817 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-10 11:40:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:19,863 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-10 11:40:19,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:40:19,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2018-11-10 11:40:19,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 36 transitions. [2018-11-10 11:40:19,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:19,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:19,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2018-11-10 11:40:19,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:19,866 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-10 11:40:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2018-11-10 11:40:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-10 11:40:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 11:40:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-10 11:40:19,868 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-10 11:40:19,868 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-10 11:40:19,868 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:40:19,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 32 transitions. [2018-11-10 11:40:19,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:19,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:19,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:19,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1] [2018-11-10 11:40:19,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:19,869 INFO L793 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 543#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 538#L13-4 assume true; 539#L13-1 assume !!(main_~n~0 < 10); 563#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 562#L14-1 havoc main_#t~nondet2; 561#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 540#L13-4 assume true; 541#L13-1 assume !!(main_~n~0 < 10); 548#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 550#L14-1 havoc main_#t~nondet2; 544#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 545#L13-4 assume true; 560#L13-1 assume !!(main_~n~0 < 10); 559#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 558#L14-1 havoc main_#t~nondet2; 557#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 556#L13-4 assume true; 552#L13-1 assume !!(main_~n~0 < 10); 555#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 554#L14-1 havoc main_#t~nondet2; 553#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 551#L13-4 assume true; 547#L13-1 assume !(main_~n~0 < 10); 537#L20-1 [2018-11-10 11:40:19,870 INFO L795 eck$LassoCheckResult]: Loop: 537#L20-1 assume true; 536#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 535#L17-1 assume main_#t~short4; 533#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 534#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 549#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 542#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 537#L20-1 [2018-11-10 11:40:19,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash -813755514, now seen corresponding path program 5 times [2018-11-10 11:40:19,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:19,918 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 11:40:19,953 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-10 11:40:19,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:19,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:19,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 11:40:19,978 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:19,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 4 times [2018-11-10 11:40:19,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:19,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:40:20,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:40:20,077 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 11:40:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:20,096 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-10 11:40:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:40:20,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 42 transitions. [2018-11-10 11:40:20,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 41 transitions. [2018-11-10 11:40:20,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:20,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:20,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2018-11-10 11:40:20,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:20,098 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-10 11:40:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2018-11-10 11:40:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-10 11:40:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 11:40:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-10 11:40:20,100 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 11:40:20,100 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 11:40:20,100 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:40:20,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-10 11:40:20,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:20,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:20,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1] [2018-11-10 11:40:20,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:20,102 INFO L793 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 695#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 690#L13-4 assume true; 691#L13-1 assume !!(main_~n~0 < 10); 720#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 719#L14-1 havoc main_#t~nondet2; 718#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 692#L13-4 assume true; 693#L13-1 assume !!(main_~n~0 < 10); 700#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 702#L14-1 havoc main_#t~nondet2; 696#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 697#L13-4 assume true; 717#L13-1 assume !!(main_~n~0 < 10); 716#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 715#L14-1 havoc main_#t~nondet2; 714#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 713#L13-4 assume true; 712#L13-1 assume !!(main_~n~0 < 10); 711#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 710#L14-1 havoc main_#t~nondet2; 709#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 708#L13-4 assume true; 704#L13-1 assume !!(main_~n~0 < 10); 707#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 706#L14-1 havoc main_#t~nondet2; 705#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 703#L13-4 assume true; 699#L13-1 assume !(main_~n~0 < 10); 689#L20-1 [2018-11-10 11:40:20,102 INFO L795 eck$LassoCheckResult]: Loop: 689#L20-1 assume true; 688#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 687#L17-1 assume main_#t~short4; 685#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 686#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 701#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 694#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 689#L20-1 [2018-11-10 11:40:20,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1555504489, now seen corresponding path program 6 times [2018-11-10 11:40:20,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:20,154 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 11:40:20,170 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-10 11:40:20,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:20,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:20,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 11:40:20,197 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 5 times [2018-11-10 11:40:20,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:40:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:40:20,271 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 11:40:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:20,289 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-10 11:40:20,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:40:20,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2018-11-10 11:40:20,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 46 transitions. [2018-11-10 11:40:20,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:20,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:20,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2018-11-10 11:40:20,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:20,291 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-10 11:40:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2018-11-10 11:40:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-10 11:40:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 11:40:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-10 11:40:20,293 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-10 11:40:20,293 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-10 11:40:20,293 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 11:40:20,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 42 transitions. [2018-11-10 11:40:20,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:20,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:20,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1] [2018-11-10 11:40:20,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:20,294 INFO L793 eck$LassoCheckResult]: Stem: 876#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 873#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 868#L13-4 assume true; 869#L13-1 assume !!(main_~n~0 < 10); 903#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 902#L14-1 havoc main_#t~nondet2; 901#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 870#L13-4 assume true; 871#L13-1 assume !!(main_~n~0 < 10); 878#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 880#L14-1 havoc main_#t~nondet2; 874#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 875#L13-4 assume true; 900#L13-1 assume !!(main_~n~0 < 10); 899#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 898#L14-1 havoc main_#t~nondet2; 897#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 896#L13-4 assume true; 895#L13-1 assume !!(main_~n~0 < 10); 894#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 893#L14-1 havoc main_#t~nondet2; 892#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 891#L13-4 assume true; 890#L13-1 assume !!(main_~n~0 < 10); 889#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 888#L14-1 havoc main_#t~nondet2; 887#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 886#L13-4 assume true; 882#L13-1 assume !!(main_~n~0 < 10); 885#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 884#L14-1 havoc main_#t~nondet2; 883#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 881#L13-4 assume true; 877#L13-1 assume !(main_~n~0 < 10); 867#L20-1 [2018-11-10 11:40:20,294 INFO L795 eck$LassoCheckResult]: Loop: 867#L20-1 assume true; 866#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 865#L17-1 assume main_#t~short4; 863#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 864#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 879#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 872#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 867#L20-1 [2018-11-10 11:40:20,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 829999462, now seen corresponding path program 7 times [2018-11-10 11:40:20,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:20,330 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:20,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:20,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 11:40:20,376 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:20,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 6 times [2018-11-10 11:40:20,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:40:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:40:20,454 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 11:40:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:20,483 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-10 11:40:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:40:20,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 52 transitions. [2018-11-10 11:40:20,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 51 transitions. [2018-11-10 11:40:20,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:20,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:20,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2018-11-10 11:40:20,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:20,486 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-10 11:40:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2018-11-10 11:40:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-10 11:40:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 11:40:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-10 11:40:20,491 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-10 11:40:20,491 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-10 11:40:20,491 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 11:40:20,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 47 transitions. [2018-11-10 11:40:20,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:20,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:20,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1] [2018-11-10 11:40:20,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:20,494 INFO L793 eck$LassoCheckResult]: Stem: 1080#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1077#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 1072#L13-4 assume true; 1073#L13-1 assume !!(main_~n~0 < 10); 1112#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1111#L14-1 havoc main_#t~nondet2; 1110#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1074#L13-4 assume true; 1075#L13-1 assume !!(main_~n~0 < 10); 1082#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1084#L14-1 havoc main_#t~nondet2; 1078#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1079#L13-4 assume true; 1109#L13-1 assume !!(main_~n~0 < 10); 1108#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1107#L14-1 havoc main_#t~nondet2; 1106#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1105#L13-4 assume true; 1104#L13-1 assume !!(main_~n~0 < 10); 1103#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1102#L14-1 havoc main_#t~nondet2; 1101#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1100#L13-4 assume true; 1099#L13-1 assume !!(main_~n~0 < 10); 1098#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1097#L14-1 havoc main_#t~nondet2; 1096#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1095#L13-4 assume true; 1094#L13-1 assume !!(main_~n~0 < 10); 1093#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1092#L14-1 havoc main_#t~nondet2; 1091#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1090#L13-4 assume true; 1086#L13-1 assume !!(main_~n~0 < 10); 1089#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1088#L14-1 havoc main_#t~nondet2; 1087#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1085#L13-4 assume true; 1081#L13-1 assume !(main_~n~0 < 10); 1071#L20-1 [2018-11-10 11:40:20,494 INFO L795 eck$LassoCheckResult]: Loop: 1071#L20-1 assume true; 1070#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1069#L17-1 assume main_#t~short4; 1067#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 1068#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 1083#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1076#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 1071#L20-1 [2018-11-10 11:40:20,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1446767735, now seen corresponding path program 8 times [2018-11-10 11:40:20,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:20,554 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:40:20,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:40:20,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:20,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:20,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 11:40:20,601 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 7 times [2018-11-10 11:40:20,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:40:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:40:20,715 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-10 11:40:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:20,750 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-10 11:40:20,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:40:20,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 57 transitions. [2018-11-10 11:40:20,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 56 transitions. [2018-11-10 11:40:20,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:20,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:20,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 56 transitions. [2018-11-10 11:40:20,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:20,752 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-10 11:40:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 56 transitions. [2018-11-10 11:40:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-10 11:40:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 11:40:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-10 11:40:20,755 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-10 11:40:20,755 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-10 11:40:20,755 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 11:40:20,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2018-11-10 11:40:20,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:20,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:20,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:20,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1] [2018-11-10 11:40:20,756 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:20,757 INFO L793 eck$LassoCheckResult]: Stem: 1310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1307#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 1302#L13-4 assume true; 1303#L13-1 assume !!(main_~n~0 < 10); 1347#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1346#L14-1 havoc main_#t~nondet2; 1345#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1304#L13-4 assume true; 1305#L13-1 assume !!(main_~n~0 < 10); 1312#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1314#L14-1 havoc main_#t~nondet2; 1308#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1309#L13-4 assume true; 1344#L13-1 assume !!(main_~n~0 < 10); 1343#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1342#L14-1 havoc main_#t~nondet2; 1341#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1340#L13-4 assume true; 1339#L13-1 assume !!(main_~n~0 < 10); 1338#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1337#L14-1 havoc main_#t~nondet2; 1336#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1335#L13-4 assume true; 1334#L13-1 assume !!(main_~n~0 < 10); 1333#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1332#L14-1 havoc main_#t~nondet2; 1331#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1330#L13-4 assume true; 1329#L13-1 assume !!(main_~n~0 < 10); 1328#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1327#L14-1 havoc main_#t~nondet2; 1326#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1325#L13-4 assume true; 1324#L13-1 assume !!(main_~n~0 < 10); 1323#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1322#L14-1 havoc main_#t~nondet2; 1321#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1320#L13-4 assume true; 1316#L13-1 assume !!(main_~n~0 < 10); 1319#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1318#L14-1 havoc main_#t~nondet2; 1317#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1315#L13-4 assume true; 1311#L13-1 assume !(main_~n~0 < 10); 1301#L20-1 [2018-11-10 11:40:20,757 INFO L795 eck$LassoCheckResult]: Loop: 1301#L20-1 assume true; 1300#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1299#L17-1 assume main_#t~short4; 1297#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 1298#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 1313#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1306#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 1301#L20-1 [2018-11-10 11:40:20,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 716220230, now seen corresponding path program 9 times [2018-11-10 11:40:20,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:40:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:20,825 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/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-10 11:40:20,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:40:20,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-10 11:40:20,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:20,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:20,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:20,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 11:40:20,915 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:20,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 8 times [2018-11-10 11:40:20,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:20,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:40:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:40:20,992 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 11:40:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:21,021 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-10 11:40:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:40:21,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 62 transitions. [2018-11-10 11:40:21,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:21,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 61 transitions. [2018-11-10 11:40:21,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:21,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:21,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 61 transitions. [2018-11-10 11:40:21,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:21,024 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-10 11:40:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 61 transitions. [2018-11-10 11:40:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-10 11:40:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 11:40:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-10 11:40:21,026 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-10 11:40:21,026 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-10 11:40:21,027 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 11:40:21,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 57 transitions. [2018-11-10 11:40:21,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:21,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:21,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:21,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1] [2018-11-10 11:40:21,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:21,030 INFO L793 eck$LassoCheckResult]: Stem: 1566#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1563#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 1558#L13-4 assume true; 1559#L13-1 assume !!(main_~n~0 < 10); 1608#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1607#L14-1 havoc main_#t~nondet2; 1606#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1560#L13-4 assume true; 1561#L13-1 assume !!(main_~n~0 < 10); 1568#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1570#L14-1 havoc main_#t~nondet2; 1564#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1565#L13-4 assume true; 1605#L13-1 assume !!(main_~n~0 < 10); 1604#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1603#L14-1 havoc main_#t~nondet2; 1602#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1601#L13-4 assume true; 1600#L13-1 assume !!(main_~n~0 < 10); 1599#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1598#L14-1 havoc main_#t~nondet2; 1597#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1596#L13-4 assume true; 1595#L13-1 assume !!(main_~n~0 < 10); 1594#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1593#L14-1 havoc main_#t~nondet2; 1592#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1591#L13-4 assume true; 1590#L13-1 assume !!(main_~n~0 < 10); 1589#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1588#L14-1 havoc main_#t~nondet2; 1587#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1586#L13-4 assume true; 1585#L13-1 assume !!(main_~n~0 < 10); 1584#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1583#L14-1 havoc main_#t~nondet2; 1582#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1581#L13-4 assume true; 1580#L13-1 assume !!(main_~n~0 < 10); 1579#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1578#L14-1 havoc main_#t~nondet2; 1577#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1576#L13-4 assume true; 1572#L13-1 assume !!(main_~n~0 < 10); 1575#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1574#L14-1 havoc main_#t~nondet2; 1573#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1571#L13-4 assume true; 1567#L13-1 assume !(main_~n~0 < 10); 1557#L20-1 [2018-11-10 11:40:21,030 INFO L795 eck$LassoCheckResult]: Loop: 1557#L20-1 assume true; 1556#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1555#L17-1 assume main_#t~short4; 1553#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 1554#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 1569#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1562#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 1557#L20-1 [2018-11-10 11:40:21,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2016141737, now seen corresponding path program 10 times [2018-11-10 11:40:21,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:21,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:40:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:21,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:40:21,110 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:40:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:40:21,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:40:21,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:40:21,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:40:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:40:21,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:40:21,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 11:40:21,176 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:40:21,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 9 times [2018-11-10 11:40:21,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:40:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:40:21,268 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-10 11:40:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:40:21,311 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-10 11:40:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 11:40:21,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 64 transitions. [2018-11-10 11:40:21,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:21,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 63 transitions. [2018-11-10 11:40:21,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:40:21,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 11:40:21,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 63 transitions. [2018-11-10 11:40:21,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:40:21,313 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-10 11:40:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 63 transitions. [2018-11-10 11:40:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-10 11:40:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 11:40:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-10 11:40:21,315 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-10 11:40:21,315 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-10 11:40:21,315 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 11:40:21,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 62 transitions. [2018-11-10 11:40:21,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:40:21,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:40:21,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:40:21,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1] [2018-11-10 11:40:21,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:40:21,317 INFO L793 eck$LassoCheckResult]: Stem: 1845#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1842#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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0 := 0; 1837#L13-4 assume true; 1838#L13-1 assume !!(main_~n~0 < 10); 1892#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1891#L14-1 havoc main_#t~nondet2; 1890#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1839#L13-4 assume true; 1840#L13-1 assume !!(main_~n~0 < 10); 1847#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1849#L14-1 havoc main_#t~nondet2; 1843#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1844#L13-4 assume true; 1889#L13-1 assume !!(main_~n~0 < 10); 1888#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1887#L14-1 havoc main_#t~nondet2; 1886#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1885#L13-4 assume true; 1884#L13-1 assume !!(main_~n~0 < 10); 1883#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1882#L14-1 havoc main_#t~nondet2; 1881#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1880#L13-4 assume true; 1879#L13-1 assume !!(main_~n~0 < 10); 1878#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1877#L14-1 havoc main_#t~nondet2; 1876#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1875#L13-4 assume true; 1874#L13-1 assume !!(main_~n~0 < 10); 1873#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1872#L14-1 havoc main_#t~nondet2; 1871#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1870#L13-4 assume true; 1869#L13-1 assume !!(main_~n~0 < 10); 1868#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1867#L14-1 havoc main_#t~nondet2; 1866#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1865#L13-4 assume true; 1864#L13-1 assume !!(main_~n~0 < 10); 1863#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1862#L14-1 havoc main_#t~nondet2; 1861#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1860#L13-4 assume true; 1859#L13-1 assume !!(main_~n~0 < 10); 1858#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1857#L14-1 havoc main_#t~nondet2; 1856#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1855#L13-4 assume true; 1851#L13-1 assume !!(main_~n~0 < 10); 1854#L14 SUMMARY for call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + main_~n~0 * 4, 4); srcloc: L14 1853#L14-1 havoc main_#t~nondet2; 1852#L13-3 main_#t~pre1 := main_~n~0 + 1;main_~n~0 := main_~n~0 + 1;havoc main_#t~pre1; 1850#L13-4 assume true; 1846#L13-1 assume !(main_~n~0 < 10); 1836#L20-1 [2018-11-10 11:40:21,317 INFO L795 eck$LassoCheckResult]: Loop: 1836#L20-1 assume true; 1835#L17 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 1834#L17-1 assume main_#t~short4; 1832#L17-2 SUMMARY for call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L17-2 1833#L17-3 main_#t~short4 := main_#t~mem3 >= 0; 1848#L17-5 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 1841#L20 SUMMARY for call write~int(0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L20 1836#L20-1 [2018-11-10 11:40:21,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 26520870, now seen corresponding path program 11 times [2018-11-10 11:40:21,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,333 INFO L82 PathProgramCache]: Analyzing trace with hash -411134407, now seen corresponding path program 10 times [2018-11-10 11:40:21,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:21,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:40:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash -431438476, now seen corresponding path program 1 times [2018-11-10 11:40:21,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:40:21,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:40:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:40:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:40:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:40:23,374 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 196 DAG size of output: 154 [2018-11-10 11:40:23,646 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 11:40:23,662 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:40:23,663 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:40:23,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:40:23 BoogieIcfgContainer [2018-11-10 11:40:23,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:40:23,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:40:23,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:40:23,671 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:40:23,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:40:17" (3/4) ... [2018-11-10 11:40:23,674 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 11:40:23,703 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a88b705f-3556-4838-bd66-8cc51004f6a6/bin-2019/uautomizer/witness.graphml [2018-11-10 11:40:23,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:40:23,704 INFO L168 Benchmark]: Toolchain (without parser) took 6121.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -67.5 MB). Peak memory consumption was 123.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:40:23,705 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:40:23,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.53 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:40:23,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:40:23,706 INFO L168 Benchmark]: Boogie Preprocessor took 18.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:40:23,706 INFO L168 Benchmark]: RCFGBuilder took 206.90 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.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:40:23,706 INFO L168 Benchmark]: BuchiAutomizer took 5684.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 150.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:40:23,707 INFO L168 Benchmark]: Witness Printer took 32.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:40:23,709 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.53 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.80 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 206.90 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.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5684.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 150.2 MB. Max. memory is 11.5 GB. * Witness Printer took 32.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 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. 11 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 61 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 5.0s. 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 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 37 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 61 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 153 SDtfs, 182 SDslu, 487 SDs, 0 SdLazy, 254 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU9 SILI2 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp93 ukn96 mio100 lsp51 div100 bol100 ite100 ukn100 eq173 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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. [2018-11-10 11:40:23,716 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:40:23,718 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:40:23,719 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:40:23,719 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled 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@145d4ff5=0, NULL=0, \result=0, n=10, i=5, a=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@745c3241=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1970ae12=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@375cdb22=0, NULL=40, NULL=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ce77110=0, NULL=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@6c78827e=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] CALL int a[10]; [L11] RET int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] FCALL a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR, FCALL a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] FCALL a[i] = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...