./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54e32ac14491e98c150c8fd937f55676029a26c7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:23,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:23,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:23,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:23,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:23,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:23,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:23,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:23,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:23,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:23,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:23,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:23,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:23,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:23,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:23,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:23,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:23,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:23,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:23,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:23,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:23,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:23,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:23,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:23,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:23,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:23,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:23,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:23,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:23,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:23,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:23,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:23,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:23,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:23,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:23,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:23,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:23,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:23,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:23,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:23,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:23,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:23,247 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:23,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:23,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:23,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:23,248 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:23,249 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:23,249 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:23,249 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:23,249 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:23,249 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:23,249 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:23,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:23,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:23,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:23,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:23,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:23,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:23,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:23,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:23,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:23,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:23,253 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:23,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:23,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:23,254 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:23,255 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:23,257 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54e32ac14491e98c150c8fd937f55676029a26c7 [2019-10-22 08:54:23,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:23,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:23,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:23,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:23,304 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:23,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-10-22 08:54:23,349 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/data/1ba359497/622fa1d11fdc4041917229f0e904cd93/FLAG61b80a802 [2019-10-22 08:54:23,674 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:23,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-10-22 08:54:23,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/data/1ba359497/622fa1d11fdc4041917229f0e904cd93/FLAG61b80a802 [2019-10-22 08:54:24,076 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/data/1ba359497/622fa1d11fdc4041917229f0e904cd93 [2019-10-22 08:54:24,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:24,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:24,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:24,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:24,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:24,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4397ca16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24, skipping insertion in model container [2019-10-22 08:54:24,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,097 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:24,114 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:24,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:24,303 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:24,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:24,405 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:24,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24 WrapperNode [2019-10-22 08:54:24,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:24,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:24,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:24,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:24,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:24,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:24,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:24,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:24,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... [2019-10-22 08:54:24,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:24,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:24,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:24,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:24,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:24,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:24,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:24,671 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:24,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:24 BoogieIcfgContainer [2019-10-22 08:54:24,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:24,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:24,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:24,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:24,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:24,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:24" (1/3) ... [2019-10-22 08:54:24,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75728e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:24, skipping insertion in model container [2019-10-22 08:54:24,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:24,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:24" (2/3) ... [2019-10-22 08:54:24,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75728e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:24, skipping insertion in model container [2019-10-22 08:54:24,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:24,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:24" (3/3) ... [2019-10-22 08:54:24,688 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2019-10-22 08:54:24,776 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:24,776 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:24,776 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:24,776 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:24,776 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:24,776 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:24,776 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:24,776 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:24,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:54:24,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:54:24,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:24,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:24,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:24,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:24,851 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:24,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:54:24,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:54:24,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:24,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:24,854 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:24,855 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:24,862 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 17#L7-3true [2019-10-22 08:54:24,862 INFO L793 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 3#L7-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 17#L7-3true [2019-10-22 08:54:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,868 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:54:24,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321821880] [2019-10-22 08:54:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:24,987 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:54:24,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:24,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307857877] [2019-10-22 08:54:24,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:24,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,004 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,006 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:54:25,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114434696] [2019-10-22 08:54:25,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:25,184 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:25,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:25,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:25,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:25,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:25,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:25,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:25,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:25,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2019-10-22 08:54:25,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:25,187 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:25,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:25,460 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:25,465 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:25,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:25,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:25,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:25,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:25,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:25,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:25,477 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:25,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:25,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:25,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:25,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:25,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:25,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:25,516 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:25,516 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:25,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:25,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:25,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:25,522 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:25,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:25,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:25,525 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:25,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:25,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:25,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:25,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:25,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:25,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:25,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:25,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:25,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:25,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:25,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:25,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:25,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:25,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:25,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:25,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:25,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:25,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:25,629 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:25,705 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:54:25,705 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:25,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:25,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:25,712 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:25,713 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-10-22 08:54:25,720 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:25,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:25,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:54:25,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-10-22 08:54:25,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 29 states and 41 transitions. Complement of second has 8 states. [2019-10-22 08:54:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-10-22 08:54:25,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:54:25,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:54:25,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:54:25,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:25,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2019-10-22 08:54:25,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:54:25,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2019-10-22 08:54:25,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:54:25,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:25,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 08:54:25,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:25,852 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:54:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 08:54:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 08:54:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:54:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 08:54:25,878 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:54:25,878 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:54:25,878 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:25,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 08:54:25,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-10-22 08:54:25,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:25,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:25,880 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:54:25,880 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:25,880 INFO L791 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 88#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 89#L7-3 assume !(main_~i~0 < 100000); 98#L7-4 main_~i~0 := 0; 97#L11-3 [2019-10-22 08:54:25,880 INFO L793 eck$LassoCheckResult]: Loop: 97#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 96#L2 assume !(0 == __VERIFIER_assert_~cond); 90#L2-3 havoc main_#t~mem2; 91#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 99#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 97#L11-3 [2019-10-22 08:54:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 08:54:25,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907481747] [2019-10-22 08:54:25,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:25,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907481747] [2019-10-22 08:54:25,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:25,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:25,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705249211] [2019-10-22 08:54:25,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2019-10-22 08:54:25,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:25,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238197113] [2019-10-22 08:54:25,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:25,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:25,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:26,076 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:54:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:26,100 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-10-22 08:54:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:26,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-10-22 08:54:26,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2019-10-22 08:54:26,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:54:26,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:54:26,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-10-22 08:54:26,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:26,104 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-22 08:54:26,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-10-22 08:54:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-10-22 08:54:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:54:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-22 08:54:26,106 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:54:26,106 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-22 08:54:26,106 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:26,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-10-22 08:54:26,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:26,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:26,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:26,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:26,108 INFO L791 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 126#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 129#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 130#L7-3 assume !(main_~i~0 < 100000); 134#L7-4 main_~i~0 := 0; 135#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 139#L2 assume !(0 == __VERIFIER_assert_~cond); 138#L2-3 havoc main_#t~mem2; 136#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-10-22 08:54:26,108 INFO L793 eck$LassoCheckResult]: Loop: 137#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 133#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 132#L2 assume !(0 == __VERIFIER_assert_~cond); 127#L2-3 havoc main_#t~mem2; 128#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-10-22 08:54:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2019-10-22 08:54:26,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483709894] [2019-10-22 08:54:26,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483709894] [2019-10-22 08:54:26,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958319099] [2019-10-22 08:54:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:26,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:26,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 08:54:26,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827977032] [2019-10-22 08:54:26,195 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2019-10-22 08:54:26,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080230768] [2019-10-22 08:54:26,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,227 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:26,382 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-10-22 08:54:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:26,428 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-22 08:54:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:26,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-10-22 08:54:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2019-10-22 08:54:26,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 08:54:26,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 08:54:26,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-10-22 08:54:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:26,432 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-22 08:54:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-10-22 08:54:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-22 08:54:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:54:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-22 08:54:26,436 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:54:26,436 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-22 08:54:26,436 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:26,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-10-22 08:54:26,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:26,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:26,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:54:26,440 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:26,440 INFO L791 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 202#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 212#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 213#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 203#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L7-3 assume !(main_~i~0 < 100000); 208#L7-4 main_~i~0 := 0; 209#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 220#L2 assume !(0 == __VERIFIER_assert_~cond); 219#L2-3 havoc main_#t~mem2; 218#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 211#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 207#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L2 assume !(0 == __VERIFIER_assert_~cond); 199#L2-3 havoc main_#t~mem2; 200#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-10-22 08:54:26,440 INFO L793 eck$LassoCheckResult]: Loop: 210#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 217#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 216#L2 assume !(0 == __VERIFIER_assert_~cond); 215#L2-3 havoc main_#t~mem2; 214#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-10-22 08:54:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2019-10-22 08:54:26,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203971748] [2019-10-22 08:54:26,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:54:26,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203971748] [2019-10-22 08:54:26,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520483925] [2019-10-22 08:54:26,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:54:26,578 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:26,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-22 08:54:26,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371785092] [2019-10-22 08:54:26,579 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2019-10-22 08:54:26,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90016271] [2019-10-22 08:54:26,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:26,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:26,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:26,750 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-10-22 08:54:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:26,814 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-10-22 08:54:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:26,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2019-10-22 08:54:26,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2019-10-22 08:54:26,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:54:26,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:54:26,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-10-22 08:54:26,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:26,818 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-22 08:54:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-10-22 08:54:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-10-22 08:54:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:54:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-22 08:54:26,821 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-22 08:54:26,821 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-22 08:54:26,822 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:26,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2019-10-22 08:54:26,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:26,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:26,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:26,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-10-22 08:54:26,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:26,824 INFO L791 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 309#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 310#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 323#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 324#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 313#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 314#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 326#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 325#L7-3 assume !(main_~i~0 < 100000); 318#L7-4 main_~i~0 := 0; 317#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 316#L2 assume !(0 == __VERIFIER_assert_~cond); 311#L2-3 havoc main_#t~mem2; 312#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 321#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 322#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 337#L2 assume !(0 == __VERIFIER_assert_~cond); 336#L2-3 havoc main_#t~mem2; 331#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 332#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 335#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 334#L2 assume !(0 == __VERIFIER_assert_~cond); 333#L2-3 havoc main_#t~mem2; 319#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-10-22 08:54:26,824 INFO L793 eck$LassoCheckResult]: Loop: 320#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 330#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 329#L2 assume !(0 == __VERIFIER_assert_~cond); 328#L2-3 havoc main_#t~mem2; 327#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-10-22 08:54:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2019-10-22 08:54:26,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537920340] [2019-10-22 08:54:26,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:26,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537920340] [2019-10-22 08:54:26,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948617722] [2019-10-22 08:54:26,900 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:26,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:54:26,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:26,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:54:26,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:26,975 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:26,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 08:54:26,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322980492] [2019-10-22 08:54:26,976 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2019-10-22 08:54:26,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:26,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558920856] [2019-10-22 08:54:26,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:26,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:26,987 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:27,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:27,127 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-10-22 08:54:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:27,183 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-22 08:54:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:27,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-10-22 08:54:27,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:27,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2019-10-22 08:54:27,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 08:54:27,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:54:27,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2019-10-22 08:54:27,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:27,186 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-10-22 08:54:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2019-10-22 08:54:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-22 08:54:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 08:54:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-22 08:54:27,189 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-22 08:54:27,189 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-22 08:54:27,189 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:27,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-10-22 08:54:27,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:27,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:27,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:27,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2019-10-22 08:54:27,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:27,191 INFO L791 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 458#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 468#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 469#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 459#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 460#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 473#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 472#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 471#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 470#L7-3 assume !(main_~i~0 < 100000); 464#L7-4 main_~i~0 := 0; 465#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 490#L2 assume !(0 == __VERIFIER_assert_~cond); 489#L2-3 havoc main_#t~mem2; 488#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 467#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 463#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 462#L2 assume !(0 == __VERIFIER_assert_~cond); 455#L2-3 havoc main_#t~mem2; 456#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 466#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 487#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 486#L2 assume !(0 == __VERIFIER_assert_~cond); 485#L2-3 havoc main_#t~mem2; 484#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 483#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 482#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 481#L2 assume !(0 == __VERIFIER_assert_~cond); 480#L2-3 havoc main_#t~mem2; 479#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-10-22 08:54:27,191 INFO L793 eck$LassoCheckResult]: Loop: 475#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 478#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 477#L2 assume !(0 == __VERIFIER_assert_~cond); 476#L2-3 havoc main_#t~mem2; 474#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-10-22 08:54:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2019-10-22 08:54:27,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:27,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797066367] [2019-10-22 08:54:27,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 08:54:27,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797066367] [2019-10-22 08:54:27,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560440047] [2019-10-22 08:54:27,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_695428fb-288a-4660-bed3-e2059b422ca0/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:27,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-22 08:54:27,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:54:27,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:54:27,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:27,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-22 08:54:27,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:27,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:27,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:54:27,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-10-22 08:54:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-22 08:54:27,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:27,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-10-22 08:54:27,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548069635] [2019-10-22 08:54:27,370 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2019-10-22 08:54:27,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:27,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378143024] [2019-10-22 08:54:27,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:27,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:27,393 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:27,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:27,547 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-10-22 08:54:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:27,582 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-10-22 08:54:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:27,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2019-10-22 08:54:27,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:27,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:27,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:27,583 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:54:27,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:27,583 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:27,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:27,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:27 BoogieIcfgContainer [2019-10-22 08:54:27,590 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:27,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:27,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:27,591 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:27,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:24" (3/4) ... [2019-10-22 08:54:27,594 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:27,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:27,596 INFO L168 Benchmark]: Toolchain (without parser) took 3516.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -239.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:27,596 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:27,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:27,597 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,598 INFO L168 Benchmark]: RCFGBuilder took 209.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,598 INFO L168 Benchmark]: BuchiAutomizer took 2916.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). Peak memory consumption was 914.4 kB. Max. memory is 11.5 GB. [2019-10-22 08:54:27,599 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:27,601 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2916.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.7 MB). Peak memory consumption was 914.4 kB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 62 SDslu, 48 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn60 mio100 lsp68 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...