./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/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 64bit --witnessprinter.graph.data.programhash ace4aef293e19a259ba259e8c5434d0ef43394b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:33:19,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:19,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:19,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:19,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:19,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:19,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:19,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:19,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:19,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:19,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:19,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:19,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:19,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:19,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:19,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:19,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:19,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:19,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:19,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:19,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:19,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:19,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:19,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:19,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:19,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:19,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:19,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:19,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:19,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:19,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:19,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:19,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:19,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:19,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:19,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:19,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:19,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:19,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:19,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:19,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:19,691 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:33:19,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:19,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:19,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:19,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:19,721 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:19,721 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:33:19,722 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:33:19,722 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:33:19,722 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:33:19,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:33:19,722 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:33:19,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:33:19,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:33:19,724 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:33:19,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:19,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:33:19,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:19,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:19,724 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:33:19,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:19,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:33:19,725 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:33:19,726 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:33:19,726 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_549f57fd-ae5c-4846-94ca-e349f41d8fbf/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2019-11-15 23:33:19,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:19,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:19,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:19,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:19,768 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:19,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-15 23:33:19,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/data/02ef933e8/79016886527d41aebcd7095b2d1a3177/FLAG7043b6924 [2019-11-15 23:33:20,313 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:20,313 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2019-11-15 23:33:20,324 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/data/02ef933e8/79016886527d41aebcd7095b2d1a3177/FLAG7043b6924 [2019-11-15 23:33:20,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/data/02ef933e8/79016886527d41aebcd7095b2d1a3177 [2019-11-15 23:33:20,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:20,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:33:20,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:20,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:20,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:20,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:20" (1/1) ... [2019-11-15 23:33:20,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e097a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:20, skipping insertion in model container [2019-11-15 23:33:20,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:20" (1/1) ... [2019-11-15 23:33:20,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:20,676 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:21,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:21,020 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:21,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:21,123 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:21,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21 WrapperNode [2019-11-15 23:33:21,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:21,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:21,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:33:21,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:33:21,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:21,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:21,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:21,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:21,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... [2019-11-15 23:33:21,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:21,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:21,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:21,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:21,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/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-15 23:33:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:33:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:33:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:33:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:33:21,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:21,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:21,539 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:33:21,539 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:33:21,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:21 BoogieIcfgContainer [2019-11-15 23:33:21,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:33:21,541 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:33:21,541 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:33:21,544 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:33:21,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:21,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:33:20" (1/3) ... [2019-11-15 23:33:21,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51ee84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:33:21, skipping insertion in model container [2019-11-15 23:33:21,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:21,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:21" (2/3) ... [2019-11-15 23:33:21,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51ee84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:33:21, skipping insertion in model container [2019-11-15 23:33:21,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:33:21,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:21" (3/3) ... [2019-11-15 23:33:21,549 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2019-11-15 23:33:21,586 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:33:21,586 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:33:21,586 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:33:21,586 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:33:21,587 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:33:21,587 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:33:21,587 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:33:21,587 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:33:21,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:33:21,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:21,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:21,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:21,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:33:21,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:21,624 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:33:21,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-11-15 23:33:21,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:21,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:21,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:21,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:33:21,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:21,633 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 11#L552-3true [2019-11-15 23:33:21,633 INFO L793 eck$LassoCheckResult]: Loop: 11#L552-3true goto; 5#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 8#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 12#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 11#L552-3true [2019-11-15 23:33:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:33:21,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:21,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322980492] [2019-11-15 23:33:21,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:21,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2019-11-15 23:33:21,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:21,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126492892] [2019-11-15 23:33:21,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:21,812 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2019-11-15 23:33:21,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:21,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313309368] [2019-11-15 23:33:21,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:21,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:21,946 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-15 23:33:21,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313309368] [2019-11-15 23:33:21,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:21,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:33:21,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532506508] [2019-11-15 23:33:22,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:33:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:33:22,094 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-11-15 23:33:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:22,142 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-11-15 23:33:22,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:33:22,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2019-11-15 23:33:22,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:22,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2019-11-15 23:33:22,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:33:22,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:33:22,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-15 23:33:22,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:33:22,152 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 23:33:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-15 23:33:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 23:33:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 23:33:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-15 23:33:22,179 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 23:33:22,179 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 23:33:22,179 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:33:22,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-15 23:33:22,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:22,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:22,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:22,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:33:22,183 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:33:22,183 INFO L791 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 37#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 38#L552-3 goto; 39#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 40#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 42#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2019-11-15 23:33:22,183 INFO L793 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 46#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 44#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2019-11-15 23:33:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2019-11-15 23:33:22,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:22,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007398538] [2019-11-15 23:33:22,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,244 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-15 23:33:22,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:22,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466968755] [2019-11-15 23:33:22,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2019-11-15 23:33:22,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:22,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863602135] [2019-11-15 23:33:22,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:22,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:22,312 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:22,639 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:33:22,763 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 23:33:22,774 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:22,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:22,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:22,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:22,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:22,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:22,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:22,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:22,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2019-11-15 23:33:22,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:22,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:22,806 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-15 23:33:22,816 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-15 23:33:22,821 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-15 23:33:23,056 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-11-15 23:33:23,101 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-15 23:33:23,104 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-15 23:33:23,108 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-15 23:33:23,111 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-15 23:33:23,114 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-15 23:33:23,117 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-15 23:33:23,121 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-15 23:33:23,125 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-15 23:33:23,129 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-15 23:33:23,134 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-15 23:33:23,137 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-15 23:33:23,140 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-15 23:33:23,686 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:33:23,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:23,766 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:23,768 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-15 23:33:23,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:23,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:23,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:23,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:23,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:23,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:23,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:23,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:23,783 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-15 23:33:23,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:23,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:23,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:23,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:23,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:23,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:23,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:23,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:23,786 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-15 23:33:23,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:23,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:23,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:23,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:23,791 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:23,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:23,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:23,797 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-15 23:33:23,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:23,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:23,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:23,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:23,807 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:23,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:23,846 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:23,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:33:23,863 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:33:23,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:23,867 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:33:23,868 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:23,868 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2019-11-15 23:33:23,896 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-15 23:33:23,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:33:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:23,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:33:23,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:23,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:33:23,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:24,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-15 23:33:24,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:24,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:24,046 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-15 23:33:24,048 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-15 23:33:24,049 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-15 23:33:24,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 6 states. [2019-11-15 23:33:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:33:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 23:33:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 23:33:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 23:33:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 23:33:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:24,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-15 23:33:24,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:24,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 23:33:24,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:24,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:33:24,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-15 23:33:24,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:24,125 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:33:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-15 23:33:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 23:33:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:33:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 23:33:24,128 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:33:24,128 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:33:24,128 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:33:24,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-15 23:33:24,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:24,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:24,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:24,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:33:24,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:24,136 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 155#L552-3 goto; 169#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 168#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 167#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2019-11-15 23:33:24,136 INFO L793 eck$LassoCheckResult]: Loop: 157#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 161#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 163#L552-3 goto; 156#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 157#L552-1 [2019-11-15 23:33:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2019-11-15 23:33:24,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987849251] [2019-11-15 23:33:24,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2019-11-15 23:33:24,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633970777] [2019-11-15 23:33:24,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2019-11-15 23:33:24,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939161474] [2019-11-15 23:33:24,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:24,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939161474] [2019-11-15 23:33:24,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929712381] [2019-11-15 23:33:24,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:24,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:33:24,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:24,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:24,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:24,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:24,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:24,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:24,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:24,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:24,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:24,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:24,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:24,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:24,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:24,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:24,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:24,519 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:24,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-15 23:33:24,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558553874] [2019-11-15 23:33:24,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:33:24,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:33:24,598 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-11-15 23:33:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:24,756 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-15 23:33:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:33:24,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-15 23:33:24,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:24,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2019-11-15 23:33:24,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:24,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:24,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-11-15 23:33:24,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:24,759 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:33:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-11-15 23:33:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:33:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:33:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-15 23:33:24,762 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:33:24,762 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-15 23:33:24,762 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:33:24,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-15 23:33:24,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:24,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:24,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:24,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2019-11-15 23:33:24,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:24,764 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 244#L552-3 goto; 260#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 250#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 251#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 259#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 258#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 256#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 257#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 246#L552-1 [2019-11-15 23:33:24,764 INFO L793 eck$LassoCheckResult]: Loop: 246#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 255#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 253#L552-3 goto; 245#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 246#L552-1 [2019-11-15 23:33:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2019-11-15 23:33:24,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607566670] [2019-11-15 23:33:24,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,792 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2019-11-15 23:33:24,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640747660] [2019-11-15 23:33:24,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:24,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2019-11-15 23:33:24,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:24,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158027403] [2019-11-15 23:33:24,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:24,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:24,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158027403] [2019-11-15 23:33:24,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251152170] [2019-11-15 23:33:24,918 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:24,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:33:24,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:24,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:33:24,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:25,007 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 23:33:25,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:25,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:25,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-15 23:33:25,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:25,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:25,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:25,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:25,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:33:25,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-15 23:33:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:25,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:25,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-15 23:33:25,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945698396] [2019-11-15 23:33:25,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:33:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:33:25,194 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-15 23:33:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:25,408 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-11-15 23:33:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:33:25,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2019-11-15 23:33:25,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:25,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2019-11-15 23:33:25,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:25,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:25,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2019-11-15 23:33:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:25,410 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 23:33:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2019-11-15 23:33:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 23:33:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 23:33:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-15 23:33:25,413 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 23:33:25,413 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-15 23:33:25,413 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:33:25,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2019-11-15 23:33:25,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:25,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:25,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:25,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2019-11-15 23:33:25,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:25,415 INFO L791 eck$LassoCheckResult]: Stem: 359#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 354#L552-3 goto; 373#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 372#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 371#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 355#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 356#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 362#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 357#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 370#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 368#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 [2019-11-15 23:33:25,415 INFO L793 eck$LassoCheckResult]: Loop: 360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 361#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 363#L552-3 goto; 364#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 [2019-11-15 23:33:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2019-11-15 23:33:25,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:25,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585872100] [2019-11-15 23:33:25,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:25,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2019-11-15 23:33:25,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:25,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705688122] [2019-11-15 23:33:25,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:25,454 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2019-11-15 23:33:25,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:25,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249502594] [2019-11-15 23:33:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:25,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249502594] [2019-11-15 23:33:25,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071412957] [2019-11-15 23:33:25,602 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:25,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 23:33:25,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:25,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:33:25,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:25,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:25,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:25,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:25,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:25,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:25,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:25,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:25,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:25,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:25,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:25,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:25,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:25,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:25,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:25,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:25,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:25,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:25,891 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:25,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-15 23:33:25,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12169256] [2019-11-15 23:33:25,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:33:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:33:25,962 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-15 23:33:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:26,362 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-15 23:33:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:33:26,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-15 23:33:26,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:26,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2019-11-15 23:33:26,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:26,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:26,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-15 23:33:26,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:26,366 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:33:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-15 23:33:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-15 23:33:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:33:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-15 23:33:26,368 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:33:26,368 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-15 23:33:26,368 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:33:26,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2019-11-15 23:33:26,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:26,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:26,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:26,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2019-11-15 23:33:26,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:26,370 INFO L791 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 485#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 486#L552-3 goto; 507#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 506#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 504#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 487#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 488#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 508#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 489#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 490#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 494#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 503#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 505#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 499#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 500#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 492#L552-1 [2019-11-15 23:33:26,371 INFO L793 eck$LassoCheckResult]: Loop: 492#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 493#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 495#L552-3 goto; 496#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 492#L552-1 [2019-11-15 23:33:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2019-11-15 23:33:26,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:26,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737324123] [2019-11-15 23:33:26,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:26,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2019-11-15 23:33:26,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:26,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857671535] [2019-11-15 23:33:26,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:26,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2019-11-15 23:33:26,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:26,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141696739] [2019-11-15 23:33:26,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:26,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:26,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141696739] [2019-11-15 23:33:26,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33673418] [2019-11-15 23:33:26,604 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:26,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:33:26,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:26,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:33:26,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:26,694 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 23:33:26,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:26,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:26,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-15 23:33:26,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:26,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:26,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:26,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:26,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:26,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:26,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:26,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:26,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:33:26,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:26,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:26,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-15 23:33:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:26,877 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:26,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-15 23:33:26,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837565640] [2019-11-15 23:33:26,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:33:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:33:26,934 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-15 23:33:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:27,245 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-15 23:33:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:33:27,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2019-11-15 23:33:27,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:27,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2019-11-15 23:33:27,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:27,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:27,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2019-11-15 23:33:27,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:27,248 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 23:33:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2019-11-15 23:33:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 23:33:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:33:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-15 23:33:27,251 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 23:33:27,251 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 23:33:27,251 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:33:27,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2019-11-15 23:33:27,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:27,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:27,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:27,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2019-11-15 23:33:27,253 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:27,253 INFO L791 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 639#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 640#L552-3 goto; 649#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 657#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 664#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 641#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 642#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 653#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 643#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 644#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 648#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 663#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 662#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 661#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 660#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 659#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 658#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 655#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 646#L552-1 [2019-11-15 23:33:27,253 INFO L793 eck$LassoCheckResult]: Loop: 646#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 647#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 652#L552-3 goto; 665#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 646#L552-1 [2019-11-15 23:33:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2019-11-15 23:33:27,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:27,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896236589] [2019-11-15 23:33:27,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:27,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2019-11-15 23:33:27,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:27,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616202985] [2019-11-15 23:33:27,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:27,292 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2019-11-15 23:33:27,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:27,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630092094] [2019-11-15 23:33:27,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:27,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630092094] [2019-11-15 23:33:27,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381910590] [2019-11-15 23:33:27,508 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:27,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-15 23:33:27,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:27,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:33:27,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:27,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:27,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:27,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:27,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:27,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:27,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:27,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:27,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:27,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:27,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:27,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:27,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:27,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:27,947 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:27,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-11-15 23:33:27,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342523817] [2019-11-15 23:33:28,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:33:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:33:28,002 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand 22 states. [2019-11-15 23:33:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:28,569 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-15 23:33:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:33:28,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2019-11-15 23:33:28,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:28,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2019-11-15 23:33:28,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:28,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:28,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2019-11-15 23:33:28,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:28,572 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 23:33:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2019-11-15 23:33:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 23:33:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:33:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-15 23:33:28,575 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 23:33:28,575 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-15 23:33:28,575 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:33:28,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2019-11-15 23:33:28,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:28,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:28,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:28,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2019-11-15 23:33:28,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:28,577 INFO L791 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 816#L552-3 goto; 825#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 832#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 833#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 817#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 818#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 824#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 819#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 820#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 844#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 843#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 842#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 841#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 840#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 839#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 838#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 837#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 835#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 834#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 830#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 822#L552-1 [2019-11-15 23:33:28,578 INFO L793 eck$LassoCheckResult]: Loop: 822#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 823#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 828#L552-3 goto; 836#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 822#L552-1 [2019-11-15 23:33:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2019-11-15 23:33:28,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:28,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052379615] [2019-11-15 23:33:28,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:28,606 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2019-11-15 23:33:28,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:28,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780814918] [2019-11-15 23:33:28,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:28,615 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2019-11-15 23:33:28,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:28,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173106286] [2019-11-15 23:33:28,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:28,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:28,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173106286] [2019-11-15 23:33:28,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821581235] [2019-11-15 23:33:28,854 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:28,936 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 23:33:28,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:28,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:33:28,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:28,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:28,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:28,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:28,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:28,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:28,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:28,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:28,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:28,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:28,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:29,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:29,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:29,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:29,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:29,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:29,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:29,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:29,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:29,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:29,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:29,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:29,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2019-11-15 23:33:29,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92963825] [2019-11-15 23:33:29,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:33:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:33:29,350 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand 25 states. [2019-11-15 23:33:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:29,871 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-15 23:33:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:33:29,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-11-15 23:33:29,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:29,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2019-11-15 23:33:29,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:29,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:29,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2019-11-15 23:33:29,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:29,873 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-15 23:33:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2019-11-15 23:33:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:33:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:33:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-15 23:33:29,876 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-15 23:33:29,876 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-15 23:33:29,876 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:33:29,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2019-11-15 23:33:29,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:29,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:29,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:29,877 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2019-11-15 23:33:29,877 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:29,878 INFO L791 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1013#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1014#L552-3 goto; 1023#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1030#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1031#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1015#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1016#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1022#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1017#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1018#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1045#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1044#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1043#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1042#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1041#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1040#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1039#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1038#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1037#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1036#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1035#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1033#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1032#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1028#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1020#L552-1 [2019-11-15 23:33:29,878 INFO L793 eck$LassoCheckResult]: Loop: 1020#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1021#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1026#L552-3 goto; 1034#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1020#L552-1 [2019-11-15 23:33:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2019-11-15 23:33:29,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:29,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161814484] [2019-11-15 23:33:29,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:29,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2019-11-15 23:33:29,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:29,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42006447] [2019-11-15 23:33:29,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:29,914 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:29,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2019-11-15 23:33:29,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:29,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572902970] [2019-11-15 23:33:29,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:29,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:30,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572902970] [2019-11-15 23:33:30,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853255711] [2019-11-15 23:33:30,186 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:33:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:30,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:33:30,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:30,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:30,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:30,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:30,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:30,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:30,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:30,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:30,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:30,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:30,645 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:30,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-11-15 23:33:30,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109486806] [2019-11-15 23:33:30,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 23:33:30,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:33:30,708 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand 28 states. [2019-11-15 23:33:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:31,337 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-15 23:33:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:33:31,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-11-15 23:33:31,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:31,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2019-11-15 23:33:31,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:31,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:31,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2019-11-15 23:33:31,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:31,339 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-15 23:33:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2019-11-15 23:33:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 23:33:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:33:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-15 23:33:31,342 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-15 23:33:31,342 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-15 23:33:31,342 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:33:31,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-11-15 23:33:31,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:31,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:31,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:31,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2019-11-15 23:33:31,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:31,344 INFO L791 eck$LassoCheckResult]: Stem: 1239#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1233#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1234#L552-3 goto; 1243#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1250#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1251#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1235#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1236#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1242#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1237#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1238#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1268#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1267#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1266#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1265#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1264#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1263#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1262#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1261#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1260#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1259#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1258#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1257#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1256#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1255#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1253#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1252#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1248#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1240#L552-1 [2019-11-15 23:33:31,344 INFO L793 eck$LassoCheckResult]: Loop: 1240#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1241#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1246#L552-3 goto; 1254#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1240#L552-1 [2019-11-15 23:33:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2019-11-15 23:33:31,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:31,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833186804] [2019-11-15 23:33:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:31,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2019-11-15 23:33:31,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:31,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577152547] [2019-11-15 23:33:31,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:31,384 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2019-11-15 23:33:31,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:31,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5788424] [2019-11-15 23:33:31,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:31,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:31,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5788424] [2019-11-15 23:33:31,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419036310] [2019-11-15 23:33:31,699 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/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-15 23:33:31,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:33:31,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:31,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 23:33:31,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:31,818 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 23:33:31,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:31,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:31,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:31,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2019-11-15 23:33:31,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:31,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:31,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:31,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:31,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:31,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:31,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:31,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:31,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:31,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:31,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:31,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:31,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:32,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:32,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:32,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:32,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:32,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:32,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:32,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:32,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:32,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:32,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:33:32,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:32,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-15 23:33:32,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 23:33:32,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:32,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:32,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-15 23:33:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:32,258 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:32,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2019-11-15 23:33:32,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450228382] [2019-11-15 23:33:32,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 23:33:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:33:32,329 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 31 states. [2019-11-15 23:33:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:33,085 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-15 23:33:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:33:33,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-11-15 23:33:33,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:33,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2019-11-15 23:33:33,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:33,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:33,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2019-11-15 23:33:33,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:33,088 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-15 23:33:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2019-11-15 23:33:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-15 23:33:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:33:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-15 23:33:33,091 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-15 23:33:33,091 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-15 23:33:33,091 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:33:33,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2019-11-15 23:33:33,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:33,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:33,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:33,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2019-11-15 23:33:33,093 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:33,093 INFO L791 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1475#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1476#L552-3 goto; 1485#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1492#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1493#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1477#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1478#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1484#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1479#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1480#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1513#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1512#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1511#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1510#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1509#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1508#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1507#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1506#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1505#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1504#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1503#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1502#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1501#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1500#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1499#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1498#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1497#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1495#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1494#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1490#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1482#L552-1 [2019-11-15 23:33:33,093 INFO L793 eck$LassoCheckResult]: Loop: 1482#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1483#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1488#L552-3 goto; 1496#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1482#L552-1 [2019-11-15 23:33:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2019-11-15 23:33:33,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:33,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882467379] [2019-11-15 23:33:33,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:33,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:33,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2019-11-15 23:33:33,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:33,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055482151] [2019-11-15 23:33:33,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:33,134 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:33,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:33,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2019-11-15 23:33:33,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:33,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148253483] [2019-11-15 23:33:33,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:33,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:33,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148253483] [2019-11-15 23:33:33,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116411251] [2019-11-15 23:33:33,463 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_549f57fd-ae5c-4846-94ca-e349f41d8fbf/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-15 23:33:33,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-15 23:33:33,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:33:33,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:33:33,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:33,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 23:33:33,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 23:33:33,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:33,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:33,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:33,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:33,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:33,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:34,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-11-15 23:33:34,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:33:34,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:34,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:33:34,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:34,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:34,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 23:33:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:34,139 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:33:34,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2019-11-15 23:33:34,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046031747] [2019-11-15 23:33:34,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 23:33:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 23:33:34,186 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 34 states. [2019-11-15 23:33:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:35,099 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-15 23:33:35,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:33:35,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2019-11-15 23:33:35,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:35,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2019-11-15 23:33:35,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:33:35,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:33:35,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2019-11-15 23:33:35,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:33:35,101 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-15 23:33:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2019-11-15 23:33:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-15 23:33:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:33:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-15 23:33:35,104 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-15 23:33:35,104 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-15 23:33:35,104 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:33:35,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2019-11-15 23:33:35,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:33:35,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:33:35,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:33:35,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2019-11-15 23:33:35,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:33:35,106 INFO L791 eck$LassoCheckResult]: Stem: 1745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1739#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1740#L552-3 goto; 1749#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1756#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1757#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1741#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1742#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1748#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1743#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1744#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1780#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1779#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1778#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1777#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1776#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1775#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1774#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1773#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1772#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1771#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1770#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1769#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1768#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1767#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1766#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1765#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1764#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1763#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1762#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1761#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1759#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1758#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1754#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1746#L552-1 [2019-11-15 23:33:35,106 INFO L793 eck$LassoCheckResult]: Loop: 1746#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~post6;havoc main_#t~mem5;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1747#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1752#L552-3 goto; 1760#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1746#L552-1 [2019-11-15 23:33:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2019-11-15 23:33:35,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:35,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488560306] [2019-11-15 23:33:35,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,139 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2019-11-15 23:33:35,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:35,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004257048] [2019-11-15 23:33:35,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2019-11-15 23:33:35,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:35,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038623257] [2019-11-15 23:33:35,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:35,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:35,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:45,933 WARN L191 SmtUtils]: Spent 10.67 s on a formula simplification. DAG size of input: 203 DAG size of output: 175 [2019-11-15 23:33:46,001 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:33:46,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:33:46,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:33:46,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:33:46,002 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:33:46,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:33:46,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:33:46,002 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:33:46,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2019-11-15 23:33:46,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:33:46,002 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:33:46,005 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-15 23:33:46,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-15 23:33:46,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-15 23:33:46,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-15 23:33:46,020 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-15 23:33:46,021 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-15 23:33:46,172 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-15 23:33:46,237 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-15 23:33:46,241 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-15 23:33:46,243 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-15 23:33:46,245 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-15 23:33:46,247 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-15 23:33:46,248 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-15 23:33:46,251 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-15 23:33:46,253 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-15 23:33:46,605 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:33:46,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:33:46,667 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:33:46,667 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-15 23:33:46,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:46,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:46,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:46,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,670 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-15 23:33:46,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:46,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:46,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:46,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,671 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-15 23:33:46,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:46,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,672 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:46,672 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:46,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,674 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-15 23:33:46,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,678 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-15 23:33:46,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:33:46,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:33:46,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:33:46,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,680 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-15 23:33:46,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,682 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,686 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-15 23:33:46,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,698 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-15 23:33:46,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,701 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,705 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-15 23:33:46,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,705 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:33:46,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,708 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:33:46,709 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,716 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-15 23:33:46,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,718 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,718 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,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-15 23:33:46,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,722 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,722 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:33:46,725 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-15 23:33:46,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:33:46,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:33:46,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:33:46,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:33:46,727 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:33:46,728 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:33:46,739 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:33:46,757 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:33:46,757 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:33:46,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:33:46,758 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:33:46,758 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:33:46,759 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 + 39 Supporting invariants [1*ULTIMATE.start_main_#t~mem4 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2019-11-15 23:33:46,798 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-15 23:33:46,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:33:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:46,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:33:46,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:46,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:33:46,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:46,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:33:46,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:46,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:46,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:46,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:46,912 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:46,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 65 [2019-11-15 23:33:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:46,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:46,955 INFO L567 ElimStorePlain]: treesize reduction 52, result has 50.9 percent of original size [2019-11-15 23:33:46,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:33:46,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:47 [2019-11-15 23:33:48,253 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-15 23:33:48,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:33:48,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-15 23:33:48,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 42 states and 44 transitions. Complement of second has 4 states. [2019-11-15 23:33:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 2 accepting loop states [2019-11-15 23:33:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:33:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 23:33:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-15 23:33:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:48,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:33:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:33:48,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:48,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:33:48,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:33:48,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:33:48,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:48,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:48,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:33:48,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-15 23:33:48,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:33:48,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 65 [2019-11-15 23:33:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:33:48,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:33:48,444 INFO L567 ElimStorePlain]: treesize reduction 50, result has 52.4 percent of original size [2019-11-15 23:33:48,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 23:33:48,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:53 [2019-11-15 23:33:49,464 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-15 23:33:49,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:33:49,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-15 23:33:49,501 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 68 states and 71 transitions. Complement of second has 6 states. [2019-11-15 23:33:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:33:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:33:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 23:33:49,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 34 letters. Loop has 4 letters. [2019-11-15 23:33:49,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:49,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 38 letters. Loop has 4 letters. [2019-11-15 23:33:49,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:49,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 34 letters. Loop has 8 letters. [2019-11-15 23:33:49,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:33:49,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 71 transitions. [2019-11-15 23:33:49,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:33:49,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-11-15 23:33:49,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:33:49,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:33:49,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:33:49,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:33:49,507 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:33:49,507 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:33:49,507 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:33:49,507 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:33:49,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:33:49,507 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:33:49,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:33:49,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:33:49 BoogieIcfgContainer [2019-11-15 23:33:49,512 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:33:49,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:49,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:49,513 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:49,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:21" (3/4) ... [2019-11-15 23:33:49,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:33:49,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:49,516 INFO L168 Benchmark]: Toolchain (without parser) took 28890.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -203.3 MB). Peak memory consumption was 102.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:49,517 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:49,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:49,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.37 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-15 23:33:49,517 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 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-15 23:33:49,518 INFO L168 Benchmark]: RCFGBuilder took 343.14 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:49,518 INFO L168 Benchmark]: BuchiAutomizer took 27971.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.2 MB). Peak memory consumption was 118.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:49,518 INFO L168 Benchmark]: Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:49,520 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 495.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.37 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 21.03 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 343.14 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27971.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.2 MB). Peak memory consumption was 118.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 19 and consists of 4 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 39 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.9s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 20.2s. Construction of modules took 1.5s. Büchi inclusion checks took 5.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 11. Nontrivial modules had stage [1, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 62 SDtfs, 40 SDslu, 276 SDs, 0 SdLazy, 2384 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax107 hnf100 lsp90 ukn47 mio100 lsp40 div100 bol100 ite100 ukn100 eq175 hnf89 smp91 dnf178 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...