./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/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 860b8b475b7671f4fb04d10fe02f66a14a39a96b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:56:03,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:56:03,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:56:03,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:56:03,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:56:03,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:56:03,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:56:03,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:56:03,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:56:03,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:56:03,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:56:03,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:56:03,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:56:03,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:56:03,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:56:03,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:56:03,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:56:03,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:56:03,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:56:03,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:56:03,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:56:03,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:56:03,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:56:03,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:56:03,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:56:03,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:56:03,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:56:03,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:56:03,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:56:03,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:56:03,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:56:03,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:56:03,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:56:03,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:56:03,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:56:03,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:56:03,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:56:03,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:56:03,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:56:03,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:56:03,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:56:03,691 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 10:56:03,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:56:03,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:56:03,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:56:03,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:56:03,711 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:56:03,711 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 10:56:03,711 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 10:56:03,711 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 10:56:03,711 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 10:56:03,712 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 10:56:03,712 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 10:56:03,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:56:03,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 10:56:03,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 10:56:03,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 10:56:03,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:56:03,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:56:03,714 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 10:56:03,714 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:56:03,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 10:56:03,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:56:03,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:56:03,715 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 10:56:03,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:56:03,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:56:03,719 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 10:56:03,725 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 10:56:03,725 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/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 -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2019-11-20 10:56:03,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:56:03,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:56:03,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:56:03,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:56:03,924 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:56:03,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-20 10:56:03,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/data/bc77c002a/40117639657f447cb9f4e050078c549f/FLAGd90024d58 [2019-11-20 10:56:04,383 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:56:04,383 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-20 10:56:04,389 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/data/bc77c002a/40117639657f447cb9f4e050078c549f/FLAGd90024d58 [2019-11-20 10:56:04,804 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/data/bc77c002a/40117639657f447cb9f4e050078c549f [2019-11-20 10:56:04,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:56:04,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:56:04,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:56:04,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:56:04,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:56:04,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:04" (1/1) ... [2019-11-20 10:56:04,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9d64dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:04, skipping insertion in model container [2019-11-20 10:56:04,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:56:04" (1/1) ... [2019-11-20 10:56:04,822 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:56:04,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:56:05,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:56:05,010 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:56:05,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:56:05,133 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:56:05,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05 WrapperNode [2019-11-20 10:56:05,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:56:05,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:56:05,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:56:05,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:56:05,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:56:05,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:56:05,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:56:05,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:56:05,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... [2019-11-20 10:56:05,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:56:05,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:56:05,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:56:05,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:56:05,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:56:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:56:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:56:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:56:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:56:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:56:05,614 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:56:05,614 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 10:56:05,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:05 BoogieIcfgContainer [2019-11-20 10:56:05,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:56:05,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 10:56:05,616 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 10:56:05,621 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 10:56:05,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:56:05,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:56:04" (1/3) ... [2019-11-20 10:56:05,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@861a971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:56:05, skipping insertion in model container [2019-11-20 10:56:05,623 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:56:05,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:56:05" (2/3) ... [2019-11-20 10:56:05,624 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@861a971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:56:05, skipping insertion in model container [2019-11-20 10:56:05,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 10:56:05,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:05" (3/3) ... [2019-11-20 10:56:05,626 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-11-20 10:56:05,679 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 10:56:05,679 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 10:56:05,680 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 10:56:05,680 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:56:05,680 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:56:05,680 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 10:56:05,681 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:56:05,681 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 10:56:05,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 10:56:05,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-20 10:56:05,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:05,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:05,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 10:56:05,728 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:56:05,728 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 10:56:05,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-20 10:56:05,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-20 10:56:05,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:05,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:05,731 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 10:56:05,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 10:56:05,739 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2019-11-20 10:56:05,739 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2019-11-20 10:56:05,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 10:56:05,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:05,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998859628] [2019-11-20 10:56:05,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:05,902 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-20 10:56:05,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:05,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603166844] [2019-11-20 10:56:05,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:05,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-20 10:56:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:05,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731361708] [2019-11-20 10:56:05,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:06,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:06,203 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:56:06,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:56:06,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:56:06,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:56:06,205 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:56:06,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:56:06,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:56:06,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-11-20 10:56:06,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:56:06,206 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:56:06,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:06,662 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:56:06,668 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:06,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:06,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:06,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:06,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:06,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:06,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:06,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:06,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:06,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:06,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:56:06,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:06,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:06,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:06,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:06,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:06,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:06,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:06,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:06,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:06,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:56:06,871 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-20 10:56:06,871 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:06,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:06,895 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 10:56:06,896 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:56:06,896 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2019-11-20 10:56:06,910 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-20 10:56:06,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:56:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:06,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:56:06,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:06,996 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:56:06,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,038 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-11-20 10:56:07,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-20 10:56:07,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2019-11-20 10:56:07,101 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-11-20 10:56:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 10:56:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-20 10:56:07,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-20 10:56:07,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:07,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 10:56:07,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:07,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-20 10:56:07,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:07,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-11-20 10:56:07,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-11-20 10:56:07,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-20 10:56:07,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-20 10:56:07,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-20 10:56:07,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:07,125 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-20 10:56:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-20 10:56:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-20 10:56:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-20 10:56:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-20 10:56:07,157 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-20 10:56:07,157 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-20 10:56:07,157 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 10:56:07,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-20 10:56:07,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:07,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:07,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 10:56:07,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:07,160 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2019-11-20 10:56:07,160 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2019-11-20 10:56:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-20 10:56:07,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027834332] [2019-11-20 10:56:07,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027834332] [2019-11-20 10:56:07,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:56:07,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:56:07,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623706980] [2019-11-20 10:56:07,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-11-20 10:56:07,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737490865] [2019-11-20 10:56:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:07,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:07,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:56:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:56:07,368 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-20 10:56:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:07,389 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-20 10:56:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:56:07,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-20 10:56:07,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-20 10:56:07,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:07,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:07,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-20 10:56:07,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:07,392 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-20 10:56:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-20 10:56:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-11-20 10:56:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-20 10:56:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-20 10:56:07,393 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-20 10:56:07,393 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-20 10:56:07,393 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 10:56:07,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-20 10:56:07,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:07,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:07,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 10:56:07,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:07,395 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2019-11-20 10:56:07,395 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2019-11-20 10:56:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-20 10:56:07,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184137751] [2019-11-20 10:56:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184137751] [2019-11-20 10:56:07,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76896523] [2019-11-20 10:56:07,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:07,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:56:07,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:07,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 10:56:07,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426518635] [2019-11-20 10:56:07,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,483 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-11-20 10:56:07,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874086643] [2019-11-20 10:56:07,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:07,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:56:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:56:07,592 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-20 10:56:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:07,620 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-20 10:56:07,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:56:07,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-20 10:56:07,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-20 10:56:07,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:07,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:07,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-20 10:56:07,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:07,623 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-20 10:56:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-20 10:56:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-20 10:56:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 10:56:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-20 10:56:07,625 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-20 10:56:07,625 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-20 10:56:07,625 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 10:56:07,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-20 10:56:07,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:07,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:07,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-20 10:56:07,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:07,626 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2019-11-20 10:56:07,626 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2019-11-20 10:56:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-20 10:56:07,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628571297] [2019-11-20 10:56:07,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628571297] [2019-11-20 10:56:07,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397474487] [2019-11-20 10:56:07,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:07,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:56:07,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:07,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:56:07,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:07,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-20 10:56:07,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483442843] [2019-11-20 10:56:07,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-11-20 10:56:07,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018455138] [2019-11-20 10:56:07,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:07,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:07,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:56:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:56:07,832 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-20 10:56:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:07,872 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-20 10:56:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:56:07,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-20 10:56:07,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-20 10:56:07,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:07,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:07,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-20 10:56:07,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:07,875 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-20 10:56:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-20 10:56:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-20 10:56:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-20 10:56:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-20 10:56:07,877 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-20 10:56:07,877 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-20 10:56:07,878 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 10:56:07,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-20 10:56:07,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:07,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:07,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:07,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-20 10:56:07,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:07,879 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2019-11-20 10:56:07,879 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2019-11-20 10:56:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-20 10:56:07,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:07,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40836493] [2019-11-20 10:56:07,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:07,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40836493] [2019-11-20 10:56:07,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652140025] [2019-11-20 10:56:07,961 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:08,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 10:56:08,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:08,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 10:56:08,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:08,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-20 10:56:08,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835769672] [2019-11-20 10:56:08,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-11-20 10:56:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403976970] [2019-11-20 10:56:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:08,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 10:56:08,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:56:08,147 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-20 10:56:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:08,190 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-20 10:56:08,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:56:08,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-20 10:56:08,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-20 10:56:08,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:08,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:08,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-20 10:56:08,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:08,193 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 10:56:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-20 10:56:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-20 10:56:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 10:56:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-20 10:56:08,195 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-20 10:56:08,195 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-20 10:56:08,195 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 10:56:08,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-20 10:56:08,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:08,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:08,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-20 10:56:08,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:08,200 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2019-11-20 10:56:08,200 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2019-11-20 10:56:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-20 10:56:08,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531076642] [2019-11-20 10:56:08,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531076642] [2019-11-20 10:56:08,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884875590] [2019-11-20 10:56:08,274 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:08,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 10:56:08,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:08,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 10:56:08,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:08,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 10:56:08,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716357184] [2019-11-20 10:56:08,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-11-20 10:56:08,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530487183] [2019-11-20 10:56:08,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:08,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:56:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:56:08,463 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-20 10:56:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:08,509 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-20 10:56:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:56:08,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-20 10:56:08,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-20 10:56:08,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:08,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:08,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-20 10:56:08,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:08,511 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-20 10:56:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-20 10:56:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-20 10:56:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 10:56:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-20 10:56:08,513 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 10:56:08,514 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-20 10:56:08,514 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 10:56:08,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-20 10:56:08,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:08,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:08,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-20 10:56:08,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:08,515 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2019-11-20 10:56:08,515 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2019-11-20 10:56:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-20 10:56:08,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655884663] [2019-11-20 10:56:08,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655884663] [2019-11-20 10:56:08,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196863213] [2019-11-20 10:56:08,589 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:08,645 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 10:56:08,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:08,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 10:56:08,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:08,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-20 10:56:08,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496400449] [2019-11-20 10:56:08,660 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-11-20 10:56:08,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510746332] [2019-11-20 10:56:08,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:08,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:08,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:56:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:56:08,772 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-20 10:56:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:08,825 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-20 10:56:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:56:08,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-11-20 10:56:08,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-11-20 10:56:08,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:08,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:08,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-11-20 10:56:08,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:08,828 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-20 10:56:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-11-20 10:56:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-20 10:56:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 10:56:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-20 10:56:08,831 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-20 10:56:08,831 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-20 10:56:08,831 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 10:56:08,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-20 10:56:08,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:08,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:08,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:08,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-11-20 10:56:08,832 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:08,833 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2019-11-20 10:56:08,833 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2019-11-20 10:56:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-11-20 10:56:08,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:08,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526904006] [2019-11-20 10:56:08,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526904006] [2019-11-20 10:56:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008145090] [2019-11-20 10:56:08,928 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:08,993 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-20 10:56:08,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:08,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:56:08,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:09,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-20 10:56:09,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631180932] [2019-11-20 10:56:09,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-11-20 10:56:09,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271710091] [2019-11-20 10:56:09,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:09,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:56:09,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:56:09,116 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-20 10:56:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:09,171 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-20 10:56:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:56:09,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-20 10:56:09,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-11-20 10:56:09,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:09,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:09,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-11-20 10:56:09,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:09,174 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-20 10:56:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-11-20 10:56:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-20 10:56:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-20 10:56:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-20 10:56:09,175 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-20 10:56:09,176 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-20 10:56:09,176 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 10:56:09,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-20 10:56:09,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:09,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:09,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-11-20 10:56:09,177 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:09,178 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2019-11-20 10:56:09,178 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2019-11-20 10:56:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,178 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-11-20 10:56:09,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906693567] [2019-11-20 10:56:09,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906693567] [2019-11-20 10:56:09,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872316582] [2019-11-20 10:56:09,275 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:09,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 10:56:09,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:09,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-20 10:56:09,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415324176] [2019-11-20 10:56:09,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-11-20 10:56:09,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453247855] [2019-11-20 10:56:09,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:09,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 10:56:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:56:09,408 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-20 10:56:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:09,453 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-20 10:56:09,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:56:09,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-11-20 10:56:09,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-11-20 10:56:09,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:09,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:09,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-11-20 10:56:09,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:09,456 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-20 10:56:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-11-20 10:56:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-20 10:56:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 10:56:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-20 10:56:09,458 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-20 10:56:09,459 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-20 10:56:09,459 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 10:56:09,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-20 10:56:09,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:09,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:09,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-11-20 10:56:09,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:09,461 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2019-11-20 10:56:09,461 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2019-11-20 10:56:09,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-11-20 10:56:09,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044099970] [2019-11-20 10:56:09,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044099970] [2019-11-20 10:56:09,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087928151] [2019-11-20 10:56:09,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:09,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 10:56:09,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:09,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:56:09,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:09,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-20 10:56:09,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240507579] [2019-11-20 10:56:09,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-11-20 10:56:09,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840105636] [2019-11-20 10:56:09,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:09,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:09,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:56:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:56:09,724 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-20 10:56:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:09,782 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-20 10:56:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:56:09,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-20 10:56:09,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-11-20 10:56:09,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-20 10:56:09,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-20 10:56:09,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-11-20 10:56:09,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:09,784 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-20 10:56:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-11-20 10:56:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-20 10:56:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 10:56:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-20 10:56:09,787 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-20 10:56:09,787 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-20 10:56:09,787 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 10:56:09,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-20 10:56:09,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:09,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:09,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:09,789 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-11-20 10:56:09,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:09,789 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2019-11-20 10:56:09,789 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2019-11-20 10:56:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-11-20 10:56:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188151860] [2019-11-20 10:56:09,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188151860] [2019-11-20 10:56:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840326707] [2019-11-20 10:56:09,891 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:09,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-20 10:56:09,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:09,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 10:56:09,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-20 10:56:09,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603410277] [2019-11-20 10:56:09,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:09,999 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-11-20 10:56:09,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:09,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881877135] [2019-11-20 10:56:09,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:10,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:10,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 10:56:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:56:10,089 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-20 10:56:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:10,166 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-20 10:56:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:56:10,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-20 10:56:10,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:10,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-11-20 10:56:10,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-20 10:56:10,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-20 10:56:10,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-11-20 10:56:10,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:10,169 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-20 10:56:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-11-20 10:56:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-20 10:56:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 10:56:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-20 10:56:10,171 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-20 10:56:10,172 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-20 10:56:10,172 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 10:56:10,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-20 10:56:10,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:10,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:10,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:10,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-11-20 10:56:10,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:10,174 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2019-11-20 10:56:10,174 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2019-11-20 10:56:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-11-20 10:56:10,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:10,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343027524] [2019-11-20 10:56:10,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343027524] [2019-11-20 10:56:10,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816291118] [2019-11-20 10:56:10,331 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:56:10,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 10:56:10,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 10:56:10,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:56:10,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:10,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:56:10,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-20 10:56:10,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730092048] [2019-11-20 10:56:10,397 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 10:56:10,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-11-20 10:56:10,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:10,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711927251] [2019-11-20 10:56:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:10,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:56:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 10:56:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:56:10,480 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-11-20 10:56:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:56:10,582 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-20 10:56:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 10:56:10,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-11-20 10:56:10,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:10,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-11-20 10:56:10,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-20 10:56:10,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-20 10:56:10,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-11-20 10:56:10,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:10,584 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-20 10:56:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-11-20 10:56:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-20 10:56:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 10:56:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-20 10:56:10,586 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-20 10:56:10,586 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-20 10:56:10,586 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 10:56:10,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-20 10:56:10,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-20 10:56:10,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 10:56:10,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 10:56:10,588 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-11-20 10:56:10,588 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-20 10:56:10,588 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2019-11-20 10:56:10,588 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2019-11-20 10:56:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-11-20 10:56:10,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:10,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813583879] [2019-11-20 10:56:10,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-11-20 10:56:10,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208410798] [2019-11-20 10:56:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-11-20 10:56:10,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:56:10,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395579563] [2019-11-20 10:56:10,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:56:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:56:10,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:56:21,557 WARN L191 SmtUtils]: Spent 10.77 s on a formula simplification. DAG size of input: 217 DAG size of output: 163 [2019-11-20 10:56:21,885 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-20 10:56:21,889 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 10:56:21,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 10:56:21,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 10:56:21,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 10:56:21,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 10:56:21,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:21,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 10:56:21,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 10:56:21,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-11-20 10:56:21,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 10:56:21,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 10:56:21,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:21,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:21,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:21,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:21,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:21,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:22,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:22,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 10:56:22,194 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 10:56:22,456 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-20 10:56:22,472 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 10:56:22,472 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:22,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:22,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:22,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:22,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:22,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:22,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:22,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:22,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:22,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:22,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:56:22,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 10:56:22,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 10:56:22,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 10:56:22,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:22,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:22,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:22,605 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 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:22,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:22,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 10:56:22,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 10:56:22,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 10:56:22,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 10:56:22,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 10:56:22,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 10:56:22,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 10:56:22,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 10:56:22,690 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-20 10:56:22,690 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c3cc77-8ea8-4523-926e-0486a1f1df94/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 10:56:22,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 10:56:22,701 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 10:56:22,701 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 10:56:22,702 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2019-11-20 10:56:22,712 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-20 10:56:22,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 10:56:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:56:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:22,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:56:22,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:56:22,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:56:22,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:56:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:56:22,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-20 10:56:22,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-11-20 10:56:22,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2019-11-20 10:56:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-20 10:56:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-20 10:56:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-11-20 10:56:22,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-11-20 10:56:22,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:22,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-11-20 10:56:22,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:22,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-11-20 10:56:22,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 10:56:22,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-20 10:56:22,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 10:56:22,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-20 10:56:22,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 10:56:22,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 10:56:22,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 10:56:22,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 10:56:22,780 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:56:22,780 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:56:22,780 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:56:22,780 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 10:56:22,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:56:22,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 10:56:22,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 10:56:22,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:56:22 BoogieIcfgContainer [2019-11-20 10:56:22,787 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 10:56:22,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:56:22,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:56:22,787 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:56:22,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:56:05" (3/4) ... [2019-11-20 10:56:22,790 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:56:22,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:56:22,791 INFO L168 Benchmark]: Toolchain (without parser) took 17984.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 951.5 MB in the beginning and 915.9 MB in the end (delta: 35.6 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:22,792 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:56:22,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:22,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:56:22,793 INFO L168 Benchmark]: Boogie Preprocessor took 56.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:56:22,793 INFO L168 Benchmark]: RCFGBuilder took 373.54 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:22,794 INFO L168 Benchmark]: BuchiAutomizer took 17170.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 190.8 MB). Peak memory consumption was 246.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:56:22,794 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.2 GB. Free memory is still 915.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:56:22,796 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.77 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 56.92 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. * RCFGBuilder took 373.54 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17170.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 915.9 MB in the end (delta: 190.8 MB). Peak memory consumption was 246.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.2 GB. Free memory is still 915.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 * unknown-#length-unknown[in] and consists of 5 locations. One deterministic module has affine ranking function -1 * in + -1 * idx_in + unknown-#length-unknown[in] and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 16.0s. Construction of modules took 0.4s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 299 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf100 lsp94 ukn55 mio100 lsp58 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...