./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05.i -s /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:01,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:01,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:01,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:01,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:01,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:01,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:01,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:01,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:01,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:01,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:01,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:01,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:01,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:01,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:01,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:01,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:01,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:01,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:01,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:01,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:01,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:01,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:01,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:01,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:01,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:01,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:01,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:01,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:01,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:01,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:01,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:01,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:01,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:01,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:01,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:01,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:01,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:01,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:01,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:01,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:01,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:01,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:01,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:01,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:01,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:01,823 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:01,823 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:01,823 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:01,824 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:01,824 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:01,824 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:01,824 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:01,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:01,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:01,825 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:01,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:01,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:01,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:01,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:01,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:01,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:01,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:01,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:01,828 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:01,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:01,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:01,828 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:01,830 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:01,832 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2019-10-22 09:00:01,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:01,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:01,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:01,883 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:01,884 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:01,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-10-22 09:00:01,939 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/data/a5958bc82/1d7814da529a4cca986520c3fb31bc91/FLAG45d53eab3 [2019-10-22 09:00:02,353 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:02,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-10-22 09:00:02,361 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/data/a5958bc82/1d7814da529a4cca986520c3fb31bc91/FLAG45d53eab3 [2019-10-22 09:00:02,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/data/a5958bc82/1d7814da529a4cca986520c3fb31bc91 [2019-10-22 09:00:02,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:02,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:02,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:02,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:02,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:02,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02, skipping insertion in model container [2019-10-22 09:00:02,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,397 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:02,414 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:02,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:02,655 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:02,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:02,721 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:02,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02 WrapperNode [2019-10-22 09:00:02,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:02,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:02,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:02,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:02,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:02,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:02,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:02,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:02,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... [2019-10-22 09:00:02,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:02,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:02,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:02,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:02,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:02,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:02,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:02,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:03,261 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:03,261 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-22 09:00:03,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:03 BoogieIcfgContainer [2019-10-22 09:00:03,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:03,263 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:03,264 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:03,268 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:03,269 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:03,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:02" (1/3) ... [2019-10-22 09:00:03,270 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e7b9944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:03, skipping insertion in model container [2019-10-22 09:00:03,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:03,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:02" (2/3) ... [2019-10-22 09:00:03,271 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e7b9944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:03, skipping insertion in model container [2019-10-22 09:00:03,271 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:03,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:03" (3/3) ... [2019-10-22 09:00:03,273 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum05.i [2019-10-22 09:00:03,325 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:03,326 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:03,326 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:03,326 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:03,327 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:03,327 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:03,327 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:03,327 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:03,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-10-22 09:00:03,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-10-22 09:00:03,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:03,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:03,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:03,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:03,368 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:03,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-10-22 09:00:03,371 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-10-22 09:00:03,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:03,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:03,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:03,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:03,379 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 26#L6-3true [2019-10-22 09:00:03,379 INFO L793 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2019-10-22 09:00:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:00:03,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078999467] [2019-10-22 09:00:03,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 09:00:03,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127866787] [2019-10-22 09:00:03,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,585 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 09:00:03,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894095608] [2019-10-22 09:00:03,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,630 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,815 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:03,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:03,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:03,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:03,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:03,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:03,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:03,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:03,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration1_Lasso [2019-10-22 09:00:03,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:03,818 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:03,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:04,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:04,237 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:04,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,244 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,249 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,250 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,250 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,252 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:04,275 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,277 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:04,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,283 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:04,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:04,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:04,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:04,339 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:04,397 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:04,457 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:00:04,457 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:00:04,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:04,461 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:04,461 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:04,462 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_init_nondet_~i~0 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-10-22 09:00:04,483 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:00:04,494 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:04,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:04,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:04,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-10-22 09:00:04,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 119 transitions. Complement of second has 8 states. [2019-10-22 09:00:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-10-22 09:00:04,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 09:00:04,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:00:04,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 09:00:04,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:04,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2019-10-22 09:00:04,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:04,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2019-10-22 09:00:04,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:00:04,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:04,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-10-22 09:00:04,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:04,786 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-22 09:00:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-10-22 09:00:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 09:00:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:00:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-10-22 09:00:04,816 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-22 09:00:04,816 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-22 09:00:04,816 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:04,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-10-22 09:00:04,817 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:04,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:04,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:04,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:00:04,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:04,821 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 175#L6-3 assume !(init_nondet_~i~0 < 5); 178#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 161#L17-3 [2019-10-22 09:00:04,822 INFO L793 eck$LassoCheckResult]: Loop: 161#L17-3 assume !!(rangesum_~i~1 < 5); 169#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 160#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 161#L17-3 [2019-10-22 09:00:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 09:00:04,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:04,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863416387] [2019-10-22 09:00:04,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:04,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863416387] [2019-10-22 09:00:04,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:04,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:04,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120806436] [2019-10-22 09:00:04,872 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-10-22 09:00:04,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:04,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81984549] [2019-10-22 09:00:04,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:04,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:04,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:04,939 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-10-22 09:00:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:04,957 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-10-22 09:00:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:04,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-10-22 09:00:04,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:04,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-10-22 09:00:04,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:04,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:04,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-10-22 09:00:04,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:04,966 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:00:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-10-22 09:00:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-22 09:00:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:00:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-10-22 09:00:04,968 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 09:00:04,968 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-10-22 09:00:04,968 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:04,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-10-22 09:00:04,971 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:04,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:04,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:04,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:04,973 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:04,973 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 226#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 229#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 230#L6-3 assume !(init_nondet_~i~0 < 5); 231#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 212#L17-3 [2019-10-22 09:00:04,973 INFO L793 eck$LassoCheckResult]: Loop: 212#L17-3 assume !!(rangesum_~i~1 < 5); 220#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 211#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 212#L17-3 [2019-10-22 09:00:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-10-22 09:00:04,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:04,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640232160] [2019-10-22 09:00:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640232160] [2019-10-22 09:00:05,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994604912] [2019-10-22 09:00:05,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:00:05,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:05,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 09:00:05,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818589504] [2019-10-22 09:00:05,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,069 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-10-22 09:00:05,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428429995] [2019-10-22 09:00:05,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,079 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:05,119 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 09:00:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,137 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-10-22 09:00:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:05,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-10-22 09:00:05,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-10-22 09:00:05,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:05,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:05,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-10-22 09:00:05,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,140 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 09:00:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-10-22 09:00:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-22 09:00:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:00:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 09:00:05,142 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:00:05,142 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:00:05,142 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:05,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 09:00:05,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-10-22 09:00:05,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:05,144 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 296#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 299#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 300#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 301#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 304#L6-3 assume !(init_nondet_~i~0 < 5); 303#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 282#L17-3 [2019-10-22 09:00:05,144 INFO L793 eck$LassoCheckResult]: Loop: 282#L17-3 assume !!(rangesum_~i~1 < 5); 290#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 281#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 282#L17-3 [2019-10-22 09:00:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-10-22 09:00:05,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088007710] [2019-10-22 09:00:05,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088007710] [2019-10-22 09:00:05,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23280046] [2019-10-22 09:00:05,185 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:05,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:05,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:05,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:05,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,251 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:05,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-22 09:00:05,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663791757] [2019-10-22 09:00:05,252 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-10-22 09:00:05,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622724934] [2019-10-22 09:00:05,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,266 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:05,311 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-10-22 09:00:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,342 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-10-22 09:00:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:05,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 09:00:05,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-10-22 09:00:05,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:05,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:05,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-10-22 09:00:05,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,347 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-22 09:00:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-10-22 09:00:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-22 09:00:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 09:00:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-22 09:00:05,354 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-22 09:00:05,354 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-22 09:00:05,354 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:05,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-10-22 09:00:05,355 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,356 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-10-22 09:00:05,356 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:05,356 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 377#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 380#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 384#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 387#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 382#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 386#L6-3 assume !(init_nondet_~i~0 < 5); 385#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 363#L17-3 [2019-10-22 09:00:05,356 INFO L793 eck$LassoCheckResult]: Loop: 363#L17-3 assume !!(rangesum_~i~1 < 5); 371#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 362#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 363#L17-3 [2019-10-22 09:00:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-10-22 09:00:05,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789467275] [2019-10-22 09:00:05,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789467275] [2019-10-22 09:00:05,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247067369] [2019-10-22 09:00:05,405 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:05,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 09:00:05,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:05,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:05,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,462 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:05,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 09:00:05,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847459537] [2019-10-22 09:00:05,463 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-10-22 09:00:05,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465335300] [2019-10-22 09:00:05,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,471 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:05,512 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-10-22 09:00:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,543 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-10-22 09:00:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:00:05,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-10-22 09:00:05,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-10-22 09:00:05,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:05,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:05,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-10-22 09:00:05,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,549 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-22 09:00:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-10-22 09:00:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-22 09:00:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:00:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-10-22 09:00:05,551 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 09:00:05,551 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 09:00:05,551 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:05,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-10-22 09:00:05,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-10-22 09:00:05,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:05,556 INFO L791 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 468#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 469#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 472#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 474#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 476#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 481#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 480#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 479#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 478#L6-3 assume !(init_nondet_~i~0 < 5); 477#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 455#L17-3 [2019-10-22 09:00:05,556 INFO L793 eck$LassoCheckResult]: Loop: 455#L17-3 assume !!(rangesum_~i~1 < 5); 463#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 454#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 455#L17-3 [2019-10-22 09:00:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-10-22 09:00:05,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867100516] [2019-10-22 09:00:05,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867100516] [2019-10-22 09:00:05,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651509546] [2019-10-22 09:00:05,625 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:05,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:00:05,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:05,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,679 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:05,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-22 09:00:05,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428051525] [2019-10-22 09:00:05,680 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-10-22 09:00:05,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256337596] [2019-10-22 09:00:05,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:00:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:00:05,720 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-10-22 09:00:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,744 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 09:00:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:05,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 09:00:05,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 09:00:05,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:00:05,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:05,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-10-22 09:00:05,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,746 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:00:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-10-22 09:00:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 09:00:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:00:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 09:00:05,749 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:00:05,749 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:00:05,749 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:05,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-10-22 09:00:05,750 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,750 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-10-22 09:00:05,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:05,751 INFO L791 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 570#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 571#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 575#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 576#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 585#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 584#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 582#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 581#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 579#L6-3 assume !(init_nondet_~i~0 < 5); 578#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 557#L17-3 [2019-10-22 09:00:05,751 INFO L793 eck$LassoCheckResult]: Loop: 557#L17-3 assume !!(rangesum_~i~1 < 5); 565#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 556#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 557#L17-3 [2019-10-22 09:00:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-10-22 09:00:05,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245657418] [2019-10-22 09:00:05,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,784 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-10-22 09:00:05,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689359134] [2019-10-22 09:00:05,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,799 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-10-22 09:00:05,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260651912] [2019-10-22 09:00:05,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 09:00:05,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260651912] [2019-10-22 09:00:05,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:05,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:05,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362152696] [2019-10-22 09:00:05,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:05,880 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,912 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-10-22 09:00:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:05,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-10-22 09:00:05,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-10-22 09:00:05,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 09:00:05,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 09:00:05,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-10-22 09:00:05,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,914 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-10-22 09:00:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-10-22 09:00:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-22 09:00:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 09:00:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-10-22 09:00:05,919 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-22 09:00:05,919 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-22 09:00:05,919 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:05,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-10-22 09:00:05,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:05,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:05,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:05,920 INFO L791 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 648#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 649#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 653#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 654#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 655#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 658#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 667#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 665#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 664#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 663#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 661#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 660#L6-3 assume !(init_nondet_~i~0 < 5); 659#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 656#L17-3 assume !!(rangesum_~i~1 < 5); 643#L18 assume !(rangesum_~i~1 > 2); 633#L17-2 [2019-10-22 09:00:05,921 INFO L793 eck$LassoCheckResult]: Loop: 633#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 634#L17-3 assume !!(rangesum_~i~1 < 5); 666#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 633#L17-2 [2019-10-22 09:00:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2019-10-22 09:00:05,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381304091] [2019-10-22 09:00:05,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,940 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,941 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2019-10-22 09:00:05,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176354073] [2019-10-22 09:00:05,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,947 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2019-10-22 09:00:05,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996546859] [2019-10-22 09:00:05,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 09:00:05,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996546859] [2019-10-22 09:00:05,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235378932] [2019-10-22 09:00:05,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/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-10-22 09:00:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:06,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:00:06,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 09:00:06,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:06,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-10-22 09:00:06,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289652797] [2019-10-22 09:00:06,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:06,077 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 09:00:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:06,133 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-10-22 09:00:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:06,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2019-10-22 09:00:06,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:06,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2019-10-22 09:00:06,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-10-22 09:00:06,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-10-22 09:00:06,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-10-22 09:00:06,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:06,136 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-10-22 09:00:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-10-22 09:00:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-10-22 09:00:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 09:00:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-10-22 09:00:06,142 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 09:00:06,143 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-10-22 09:00:06,143 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:06,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-10-22 09:00:06,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:06,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:06,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:06,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 09:00:06,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:06,144 INFO L791 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 798#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 799#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 803#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 804#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 805#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 808#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 821#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 820#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 816#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 815#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 814#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 813#L6-3 assume !(init_nondet_~i~0 < 5); 809#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 810#L17-3 assume !!(rangesum_~i~1 < 5); 822#L18 assume !(rangesum_~i~1 > 2); 781#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 782#L17-3 assume !!(rangesum_~i~1 < 5); 791#L18 assume !(rangesum_~i~1 > 2); 792#L17-2 [2019-10-22 09:00:06,144 INFO L793 eck$LassoCheckResult]: Loop: 792#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 818#L17-3 assume !!(rangesum_~i~1 < 5); 819#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 792#L17-2 [2019-10-22 09:00:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2019-10-22 09:00:06,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716697717] [2019-10-22 09:00:06,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2019-10-22 09:00:06,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464177993] [2019-10-22 09:00:06,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2019-10-22 09:00:06,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954341559] [2019-10-22 09:00:06,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 09:00:06,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954341559] [2019-10-22 09:00:06,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458318665] [2019-10-22 09:00:06,230 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/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-10-22 09:00:06,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:06,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:06,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:06,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 09:00:06,284 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:06,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 09:00:06,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891257922] [2019-10-22 09:00:06,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:00:06,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:00:06,320 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-10-22 09:00:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:06,388 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-22 09:00:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:06,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-10-22 09:00:06,389 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-10-22 09:00:06,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2019-10-22 09:00:06,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-10-22 09:00:06,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-10-22 09:00:06,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2019-10-22 09:00:06,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:06,390 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-10-22 09:00:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2019-10-22 09:00:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-10-22 09:00:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-22 09:00:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-22 09:00:06,392 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-22 09:00:06,392 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-22 09:00:06,392 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:06,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-10-22 09:00:06,397 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:06,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:06,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:06,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2019-10-22 09:00:06,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:06,398 INFO L791 eck$LassoCheckResult]: Stem: 975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 972#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 973#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 977#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 978#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 979#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 998#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 996#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 993#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 992#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 990#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 987#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 986#L6-3 assume !(init_nondet_~i~0 < 5); 983#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 984#L17-3 assume !!(rangesum_~i~1 < 5); 967#L18 assume !(rangesum_~i~1 > 2); 957#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 958#L17-3 assume !!(rangesum_~i~1 < 5); 980#L18 assume !(rangesum_~i~1 > 2); 1001#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1000#L17-3 assume !!(rangesum_~i~1 < 5); 999#L18 assume !(rangesum_~i~1 > 2); 997#L17-2 [2019-10-22 09:00:06,398 INFO L793 eck$LassoCheckResult]: Loop: 997#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 994#L17-3 assume !!(rangesum_~i~1 < 5); 995#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 997#L17-2 [2019-10-22 09:00:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2019-10-22 09:00:06,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016747345] [2019-10-22 09:00:06,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,427 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2019-10-22 09:00:06,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279651023] [2019-10-22 09:00:06,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,438 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2019-10-22 09:00:06,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:06,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536194020] [2019-10-22 09:00:06,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:06,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:06,478 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:07,154 WARN L191 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 120 [2019-10-22 09:00:07,243 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:07,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:07,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:07,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:07,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:07,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:07,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:07,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:07,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration10_Lasso [2019-10-22 09:00:07,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:07,244 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:07,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-10-22 09:00:07,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:07,640 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:07,640 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:07,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:07,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:07,642 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:07,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:07,644 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:07,644 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:07,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:07,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:07,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:07,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,655 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:07,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:07,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:07,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:07,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:07,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:07,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:07,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:07,666 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,666 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:07,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:07,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:07,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:07,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:07,693 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:07,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:07,701 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:07,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:07,702 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:07,702 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:07,703 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 7 Supporting invariants [] [2019-10-22 09:00:07,726 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:00:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:07,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:07,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:07,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:07,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:07,777 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-10-22 09:00:07,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-10-22 09:00:07,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 7 states. [2019-10-22 09:00:07,802 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-10-22 09:00:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 09:00:07,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 09:00:07,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:07,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2019-10-22 09:00:07,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:07,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2019-10-22 09:00:07,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:07,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-10-22 09:00:07,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:00:07,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2019-10-22 09:00:07,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-10-22 09:00:07,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-10-22 09:00:07,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-10-22 09:00:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:07,807 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 09:00:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-10-22 09:00:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-22 09:00:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 09:00:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-10-22 09:00:07,810 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 09:00:07,810 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 09:00:07,810 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:07,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-10-22 09:00:07,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:00:07,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:07,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:07,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:07,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:07,812 INFO L791 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1211#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1212#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1216#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1217#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1218#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1240#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1239#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1238#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1237#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1236#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1235#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1234#L6-3 assume !(init_nondet_~i~0 < 5); 1221#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1219#L17-3 assume !!(rangesum_~i~1 < 5); 1204#L18 assume !(rangesum_~i~1 > 2); 1192#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1193#L17-3 assume !!(rangesum_~i~1 < 5); 1205#L18 assume !(rangesum_~i~1 > 2); 1206#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1231#L17-3 assume !!(rangesum_~i~1 < 5); 1229#L18 assume !(rangesum_~i~1 > 2); 1226#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1224#L17-3 assume !(rangesum_~i~1 < 5); 1215#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1196#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1197#L17-8 assume !!(rangesum_~i~1 < 5); 1200#L18-2 assume !(rangesum_~i~1 > 2); 1201#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1213#L17-8 assume !!(rangesum_~i~1 < 5); 1233#L18-2 assume !(rangesum_~i~1 > 2); 1232#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1230#L17-8 assume !!(rangesum_~i~1 < 5); 1227#L18-2 assume !(rangesum_~i~1 > 2); 1225#L17-7 [2019-10-22 09:00:07,812 INFO L793 eck$LassoCheckResult]: Loop: 1225#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1222#L17-8 assume !!(rangesum_~i~1 < 5); 1223#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1225#L17-7 [2019-10-22 09:00:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2019-10-22 09:00:07,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:07,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235913371] [2019-10-22 09:00:07,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 09:00:07,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235913371] [2019-10-22 09:00:07,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:07,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:07,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893244047] [2019-10-22 09:00:07,835 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-10-22 09:00:07,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:07,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6536416] [2019-10-22 09:00:07,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:07,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:07,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:07,877 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-10-22 09:00:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:07,929 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-22 09:00:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:07,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-10-22 09:00:07,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-10-22 09:00:07,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2019-10-22 09:00:07,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-10-22 09:00:07,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-10-22 09:00:07,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2019-10-22 09:00:07,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:07,932 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-10-22 09:00:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2019-10-22 09:00:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-22 09:00:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 09:00:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-10-22 09:00:07,935 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-10-22 09:00:07,936 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-10-22 09:00:07,936 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:07,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2019-10-22 09:00:07,937 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:00:07,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:07,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:07,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:07,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:07,938 INFO L791 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1345#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1346#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1350#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1351#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1352#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1358#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1371#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1370#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1369#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1368#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !(init_nondet_~i~0 < 5); 1359#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1353#L17-3 assume !!(rangesum_~i~1 < 5); 1338#L18 assume !(rangesum_~i~1 > 2); 1326#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1327#L17-3 assume !!(rangesum_~i~1 < 5); 1376#L18 assume !(rangesum_~i~1 > 2); 1377#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1378#L17-3 assume !!(rangesum_~i~1 < 5); 1339#L18 assume !(rangesum_~i~1 > 2); 1328#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1329#L17-3 assume !!(rangesum_~i~1 < 5); 1354#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1364#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1362#L17-3 assume !(rangesum_~i~1 < 5); 1349#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1330#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1331#L17-8 assume !!(rangesum_~i~1 < 5); 1375#L18-2 assume !(rangesum_~i~1 > 2); 1347#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1344#L17-8 assume !!(rangesum_~i~1 < 5); 1334#L18-2 assume !(rangesum_~i~1 > 2); 1335#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1374#L17-8 assume !!(rangesum_~i~1 < 5); 1373#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-10-22 09:00:07,939 INFO L793 eck$LassoCheckResult]: Loop: 1367#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1372#L17-8 assume !!(rangesum_~i~1 < 5); 1361#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-10-22 09:00:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2019-10-22 09:00:07,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:07,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452650386] [2019-10-22 09:00:07,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 09:00:07,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452650386] [2019-10-22 09:00:07,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330445939] [2019-10-22 09:00:07,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/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-10-22 09:00:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:08,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:00:08,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-22 09:00:08,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:08,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-22 09:00:08,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400344231] [2019-10-22 09:00:08,054 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-10-22 09:00:08,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989672171] [2019-10-22 09:00:08,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:08,074 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:08,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:08,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:08,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:08,075 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:08,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:08,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:08,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:08,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-10-22 09:00:08,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:08,076 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:08,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:08,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:08,101 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:08,102 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:08,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:08,111 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:08,117 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:08,118 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:08,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:08,129 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:08,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:08,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:08,308 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:08,311 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:08,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:08,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:08,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:08,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:08,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:08,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:08,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:08,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-10-22 09:00:08,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:08,312 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:08,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:08,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:08,361 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:08,361 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:08,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:08,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:08,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:08,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:08,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:08,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:08,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:08,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:08,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:08,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:08,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:08,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:08,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:08,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:08,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:08,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:08,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:08,367 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:08,368 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:08,378 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:00:08,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:08,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:08,379 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:08,379 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2019-10-22 09:00:08,380 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:08,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:08,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:08,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:08,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:08,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:08,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 09:00:08,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 71 states and 83 transitions. Complement of second has 5 states. [2019-10-22 09:00:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-10-22 09:00:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2019-10-22 09:00:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2019-10-22 09:00:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2019-10-22 09:00:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:08,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2019-10-22 09:00:08,471 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:00:08,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2019-10-22 09:00:08,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 09:00:08,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-10-22 09:00:08,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2019-10-22 09:00:08,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:08,472 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-10-22 09:00:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2019-10-22 09:00:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-10-22 09:00:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 09:00:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-10-22 09:00:08,475 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-10-22 09:00:08,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:08,475 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2019-10-22 09:00:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:08,497 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2019-10-22 09:00:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:08,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2019-10-22 09:00:08,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 09:00:08,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 85 transitions. [2019-10-22 09:00:08,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-10-22 09:00:08,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-10-22 09:00:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 85 transitions. [2019-10-22 09:00:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:08,499 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-10-22 09:00:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 85 transitions. [2019-10-22 09:00:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2019-10-22 09:00:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 09:00:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-10-22 09:00:08,502 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-22 09:00:08,502 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-22 09:00:08,502 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:00:08,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 69 transitions. [2019-10-22 09:00:08,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:00:08,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:08,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:08,503 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:08,503 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:08,504 INFO L791 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1864#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1865#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1871#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1872#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1873#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1891#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1890#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1889#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1888#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1887#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1886#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1885#L6-3 assume !(init_nondet_~i~0 < 5); 1879#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1880#L17-3 assume !!(rangesum_~i~1 < 5); 1854#L18 assume !(rangesum_~i~1 > 2); 1840#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1841#L17-3 assume !!(rangesum_~i~1 < 5); 1875#L18 assume !(rangesum_~i~1 > 2); 1842#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1843#L17-3 assume !!(rangesum_~i~1 < 5); 1855#L18 assume !(rangesum_~i~1 > 2); 1856#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1892#L17-3 assume !!(rangesum_~i~1 < 5); 1883#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1882#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1874#L17-3 assume !(rangesum_~i~1 < 5); 1870#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1844#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1845#L17-8 assume !!(rangesum_~i~1 < 5); 1884#L18-2 assume !(rangesum_~i~1 > 2); 1866#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1867#L17-8 assume !!(rangesum_~i~1 < 5); 1850#L18-2 assume !(rangesum_~i~1 > 2); 1851#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1895#L17-8 assume !!(rangesum_~i~1 < 5); 1894#L18-2 assume !(rangesum_~i~1 > 2); 1893#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1861#L17-8 assume !!(rangesum_~i~1 < 5); 1848#L18-2 [2019-10-22 09:00:08,504 INFO L793 eck$LassoCheckResult]: Loop: 1848#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1849#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1881#L17-8 assume !!(rangesum_~i~1 < 5); 1848#L18-2 [2019-10-22 09:00:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash 734232641, now seen corresponding path program 1 times [2019-10-22 09:00:08,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229395349] [2019-10-22 09:00:08,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,512 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:00:08,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181420441] [2019-10-22 09:00:08,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:08,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:08,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-22 09:00:08,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229395349] [2019-10-22 09:00:08,595 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:00:08,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181420441] [2019-10-22 09:00:08,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:00:08,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-10-22 09:00:08,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444499000] [2019-10-22 09:00:08,596 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-10-22 09:00:08,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168084999] [2019-10-22 09:00:08,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,602 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:08,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:08,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:08,638 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-10-22 09:00:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:08,718 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-10-22 09:00:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:08,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2019-10-22 09:00:08,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 09:00:08,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 89 transitions. [2019-10-22 09:00:08,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-10-22 09:00:08,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-10-22 09:00:08,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 89 transitions. [2019-10-22 09:00:08,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:08,721 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-10-22 09:00:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 89 transitions. [2019-10-22 09:00:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-10-22 09:00:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 09:00:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-10-22 09:00:08,723 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-10-22 09:00:08,723 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-10-22 09:00:08,723 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 09:00:08,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2019-10-22 09:00:08,724 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 09:00:08,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:08,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:08,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:08,725 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:00:08,725 INFO L791 eck$LassoCheckResult]: Stem: 2134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2129#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2130#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2136#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2137#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2138#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2163#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2161#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2159#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2158#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2157#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2155#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2154#L6-3 assume !(init_nondet_~i~0 < 5); 2144#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2145#L17-3 assume !!(rangesum_~i~1 < 5); 2119#L18 assume !(rangesum_~i~1 > 2); 2105#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2106#L17-3 assume !!(rangesum_~i~1 < 5); 2140#L18 assume !(rangesum_~i~1 > 2); 2107#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2108#L17-3 assume !!(rangesum_~i~1 < 5); 2120#L18 assume !(rangesum_~i~1 > 2); 2121#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2165#L17-3 assume !!(rangesum_~i~1 < 5); 2164#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2150#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2151#L17-3 assume !!(rangesum_~i~1 < 5); 2149#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2148#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2139#L17-3 assume !(rangesum_~i~1 < 5); 2135#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2109#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2110#L17-8 assume !!(rangesum_~i~1 < 5); 2156#L18-2 assume !(rangesum_~i~1 > 2); 2131#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2132#L17-8 assume !!(rangesum_~i~1 < 5); 2115#L18-2 assume !(rangesum_~i~1 > 2); 2116#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2166#L17-8 assume !!(rangesum_~i~1 < 5); 2162#L18-2 assume !(rangesum_~i~1 > 2); 2160#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2126#L17-8 assume !!(rangesum_~i~1 < 5); 2113#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2114#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2153#L17-8 assume !!(rangesum_~i~1 < 5); 2147#L18-2 [2019-10-22 09:00:08,725 INFO L793 eck$LassoCheckResult]: Loop: 2147#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2152#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2146#L17-8 assume !!(rangesum_~i~1 < 5); 2147#L18-2 [2019-10-22 09:00:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2019-10-22 09:00:08,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660130131] [2019-10-22 09:00:08,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,733 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:00:08,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716907818] [2019-10-22 09:00:08,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2019-10-22 09:00:08,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649736591] [2019-10-22 09:00:08,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:08,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2019-10-22 09:00:08,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157363617] [2019-10-22 09:00:08,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,869 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:00:08,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925021266] [2019-10-22 09:00:08,869 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:08,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:00:08,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:00:08,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:08,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-22 09:00:08,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157363617] [2019-10-22 09:00:08,958 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 09:00:08,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925021266] [2019-10-22 09:00:08,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:08,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:08,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442557319] [2019-10-22 09:00:08,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:08,992 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-10-22 09:00:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:09,046 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-10-22 09:00:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:09,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2019-10-22 09:00:09,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:00:09,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2019-10-22 09:00:09,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-10-22 09:00:09,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 09:00:09,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2019-10-22 09:00:09,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:09,048 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-22 09:00:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2019-10-22 09:00:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-10-22 09:00:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 09:00:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-22 09:00:09,050 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-22 09:00:09,051 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-22 09:00:09,051 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 09:00:09,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2019-10-22 09:00:09,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 09:00:09,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:09,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:09,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:09,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:09,057 INFO L791 eck$LassoCheckResult]: Stem: 2425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2422#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2423#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2427#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2428#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2429#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2456#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2455#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2454#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2453#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2452#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2451#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2450#L6-3 assume !(init_nondet_~i~0 < 5); 2432#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2430#L17-3 assume !!(rangesum_~i~1 < 5); 2414#L18 assume !(rangesum_~i~1 > 2); 2401#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2402#L17-3 assume !!(rangesum_~i~1 < 5); 2415#L18 assume !(rangesum_~i~1 > 2); 2403#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2404#L17-3 assume !!(rangesum_~i~1 < 5); 2449#L18 assume !(rangesum_~i~1 > 2); 2446#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2448#L17-3 assume !!(rangesum_~i~1 < 5); 2445#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2443#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2441#L17-3 assume !!(rangesum_~i~1 < 5); 2439#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2437#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2435#L17-3 assume !(rangesum_~i~1 < 5); 2426#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2405#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2406#L17-8 assume !!(rangesum_~i~1 < 5); 2409#L18-2 assume !(rangesum_~i~1 > 2); 2410#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2424#L17-8 assume !!(rangesum_~i~1 < 5); 2411#L18-2 assume !(rangesum_~i~1 > 2); 2412#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2420#L17-8 assume !!(rangesum_~i~1 < 5); 2421#L18-2 assume !(rangesum_~i~1 > 2); 2447#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2444#L17-8 assume !!(rangesum_~i~1 < 5); 2442#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2440#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2438#L17-8 assume !!(rangesum_~i~1 < 5); 2436#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2434#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2433#L17-8 assume !(rangesum_~i~1 < 5); 2416#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2417#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 2418#L43-3 [2019-10-22 09:00:09,058 INFO L793 eck$LassoCheckResult]: Loop: 2418#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 2419#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 2418#L43-3 [2019-10-22 09:00:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2019-10-22 09:00:09,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963105919] [2019-10-22 09:00:09,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,066 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:00:09,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026387327] [2019-10-22 09:00:09,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-10-22 09:00:09,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879064947] [2019-10-22 09:00:09,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,191 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2019-10-22 09:00:09,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253745367] [2019-10-22 09:00:09,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,201 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 09:00:09,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789657746] [2019-10-22 09:00:09,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_16b59008-93f2-427b-be85-29fa85cfac31/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:11,736 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 356 DAG size of output: 252 [2019-10-22 09:00:28,441 WARN L191 SmtUtils]: Spent 12.58 s on a formula simplification. DAG size of input: 451 DAG size of output: 151 [2019-10-22 09:00:28,444 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:28,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:28,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:28,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:28,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:28,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:28,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:28,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:28,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration15_Lasso [2019-10-22 09:00:28,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:28,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:28,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 09:00:28,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:28,988 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 09:00:28,992 INFO L168 Benchmark]: Toolchain (without parser) took 26612.87 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 663.2 MB). Free memory was 949.9 MB in the beginning and 1.6 GB in the end (delta: -680.2 MB). Peak memory consumption was 775.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:28,992 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:28,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:28,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:28,993 INFO L168 Benchmark]: Boogie Preprocessor took 57.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:28,994 INFO L168 Benchmark]: RCFGBuilder took 411.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:28,994 INFO L168 Benchmark]: BuchiAutomizer took 25726.62 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -500.9 MB). Peak memory consumption was 786.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:28,996 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 949.9 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 411.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25726.62 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -500.9 MB). Peak memory consumption was 786.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...