./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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 279fae57395782089eff32ec1396d1726d808c7f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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.25-f470102 [2019-12-07 18:59:13,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:59:13,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:59:13,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:59:13,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:59:13,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:59:13,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:59:13,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:59:13,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:59:13,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:59:13,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:59:13,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:59:13,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:59:13,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:59:13,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:59:13,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:59:13,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:59:13,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:59:13,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:59:13,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:59:13,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:59:13,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:59:13,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:59:13,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:59:13,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:59:13,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:59:13,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:59:13,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:59:13,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:59:13,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:59:13,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:59:13,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:59:13,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:59:13,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:59:13,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:59:13,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:59:13,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:59:13,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:59:13,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:59:13,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:59:13,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:59:13,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:59:13,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:59:13,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:59:13,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:59:13,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:59:13,322 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:59:13,322 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:59:13,323 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:59:13,323 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:59:13,323 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:59:13,323 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:59:13,323 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:59:13,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:59:13,324 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:59:13,324 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:59:13,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:59:13,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:59:13,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:59:13,325 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:59:13,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:59:13,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:59:13,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:59:13,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:59:13,326 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:59:13,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:59:13,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:59:13,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:59:13,327 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:59:13,328 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:59:13,328 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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 -> 279fae57395782089eff32ec1396d1726d808c7f [2019-12-07 18:59:13,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:59:13,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:59:13,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:59:13,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:59:13,441 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:59:13,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum.i [2019-12-07 18:59:13,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/data/56370919d/4a90da905548439d9b24db2590f95e9d/FLAGcb25670bc [2019-12-07 18:59:13,807 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:59:13,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/sv-benchmarks/c/reducercommutativity/rangesum.i [2019-12-07 18:59:13,812 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/data/56370919d/4a90da905548439d9b24db2590f95e9d/FLAGcb25670bc [2019-12-07 18:59:13,820 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/data/56370919d/4a90da905548439d9b24db2590f95e9d [2019-12-07 18:59:13,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:59:13,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:59:13,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:59:13,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:59:13,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:59:13,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:59:13" (1/1) ... [2019-12-07 18:59:13,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50530b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:13, skipping insertion in model container [2019-12-07 18:59:13,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:59:13" (1/1) ... [2019-12-07 18:59:13,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:59:13,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:59:13,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:59:13,988 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:59:14,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:59:14,013 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:59:14,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14 WrapperNode [2019-12-07 18:59:14,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:59:14,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:59:14,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:59:14,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:59:14,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:59:14,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:59:14,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:59:14,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:59:14,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... [2019-12-07 18:59:14,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:59:14,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:59:14,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:59:14,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:59:14,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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-12-07 18:59:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:59:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:59:14,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:59:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:59:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:59:14,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:59:14,299 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:59:14,299 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-07 18:59:14,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:59:14 BoogieIcfgContainer [2019-12-07 18:59:14,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:59:14,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:59:14,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:59:14,303 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:59:14,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:59:14,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:59:13" (1/3) ... [2019-12-07 18:59:14,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@208b290c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:59:14, skipping insertion in model container [2019-12-07 18:59:14,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:59:14,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:59:14" (2/3) ... [2019-12-07 18:59:14,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@208b290c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:59:14, skipping insertion in model container [2019-12-07 18:59:14,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:59:14,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:59:14" (3/3) ... [2019-12-07 18:59:14,306 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2019-12-07 18:59:14,335 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:59:14,335 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:59:14,335 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:59:14,336 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:59:14,336 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:59:14,336 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:59:14,336 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:59:14,336 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:59:14,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-12-07 18:59:14,359 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-12-07 18:59:14,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:14,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:14,363 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-12-07 18:59:14,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 18:59:14,364 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:59:14,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-12-07 18:59:14,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-12-07 18:59:14,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:14,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:14,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-12-07 18:59:14,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 18:59:14,371 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 17#L7-3true [2019-12-07 18:59:14,371 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(init_nondet_~i~0 < ~N~0);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; 6#L7-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 17#L7-3true [2019-12-07 18:59:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:14,375 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 18:59:14,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:14,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009943736] [2019-12-07 18:59:14,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-12-07 18:59:14,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:14,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389028002] [2019-12-07 18:59:14,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-12-07 18:59:14,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:14,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607865991] [2019-12-07 18:59:14,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:14,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:14,650 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:14,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:14,650 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:14,650 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:14,650 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:59:14,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:14,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:14,651 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2019-12-07 18:59:14,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:14,651 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:14,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,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-12-07 18:59:14,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,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-12-07 18:59:14,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:14,941 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:14,945 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,949 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-12-07 18:59:14,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,959 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-12-07 18:59:14,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,966 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-12-07 18:59:14,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,979 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-12-07 18:59:14,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,986 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-12-07 18:59:14,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:14,993 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-12-07 18:59:14,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:14,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:14,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:14,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:14,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:14,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:14,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:14,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,001 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-12-07 18:59:15,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:15,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:15,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,013 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-12-07 18:59:15,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:15,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:15,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,027 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-12-07 18:59:15,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:15,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:15,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:15,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/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-12-07 18:59:15,037 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-12-07 18:59:15,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:15,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:15,058 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:59:15,096 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 18:59:15,096 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:59:15,103 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:59:15,103 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:59:15,104 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2019-12-07 18:59:15,113 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 18:59:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:15,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:59:15,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:15,182 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-12-07 18:59:15,183 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-12-07 18:59:15,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 86 states and 130 transitions. Complement of second has 7 states. [2019-12-07 18:59:15,271 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-12-07 18:59:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 18:59:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-12-07 18:59:15,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-12-07 18:59:15,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-12-07 18:59:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-12-07 18:59:15,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-12-07 18:59:15,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-12-07 18:59:15,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-12-07 18:59:15,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-12-07 18:59:15,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-12-07 18:59:15,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:59:15,286 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-12-07 18:59:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-12-07 18:59:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 18:59:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 18:59:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-12-07 18:59:15,306 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-12-07 18:59:15,306 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-12-07 18:59:15,306 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:59:15,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-12-07 18:59:15,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:15,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:15,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 18:59:15,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:15,308 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 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; 170#L18-3 [2019-12-07 18:59:15,308 INFO L796 eck$LassoCheckResult]: Loop: 170#L18-3 assume !!(rangesum_~i~1 < ~N~0); 172#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 181#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 170#L18-3 [2019-12-07 18:59:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-12-07 18:59:15,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328667985] [2019-12-07 18:59:15,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:15,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328667985] [2019-12-07 18:59:15,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:15,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:59:15,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470082257] [2019-12-07 18:59:15,343 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:59:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-12-07 18:59:15,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085914687] [2019-12-07 18:59:15,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:15,368 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:15,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:15,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:15,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:15,368 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:59:15,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:15,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:15,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-12-07 18:59:15,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:15,369 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:15,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:15,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:15,429 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:59:15,433 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:59:15,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:59:15,437 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/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:59:15,440 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:59:15,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:59:15,604 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:59:15,605 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:15,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:15,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:15,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:15,606 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:59:15,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:15,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:15,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-12-07 18:59:15,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:15,607 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:15,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:15,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:15,669 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:15,669 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,672 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-12-07 18:59:15,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:15,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:15,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:15,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,685 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-12-07 18:59:15,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:15,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:15,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:15,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:15,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:15,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:15,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:15,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:59:15,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 18:59:15,694 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:15,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:59:15,697 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:59:15,697 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:59:15,697 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2019-12-07 18:59:15,699 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:59:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:15,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,721 WARN L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:59:15,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:15,749 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-12-07 18:59:15,749 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-12-07 18:59:15,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2019-12-07 18:59:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-12-07 18:59:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:59:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-12-07 18:59:15,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-12-07 18:59:15,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-12-07 18:59:15,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-12-07 18:59:15,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:15,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-12-07 18:59:15,776 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-12-07 18:59:15,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 18:59:15,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-12-07 18:59:15,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-12-07 18:59:15,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:15,778 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-12-07 18:59:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-12-07 18:59:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-12-07 18:59:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 18:59:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-12-07 18:59:15,781 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-12-07 18:59:15,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:59:15,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:59:15,783 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-12-07 18:59:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:15,808 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-12-07 18:59:15,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:59:15,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-12-07 18:59:15,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-12-07 18:59:15,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 18:59:15,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 18:59:15,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-12-07 18:59:15,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:15,810 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-12-07 18:59:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-12-07 18:59:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-12-07 18:59:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 18:59:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-12-07 18:59:15,812 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-12-07 18:59:15,812 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-12-07 18:59:15,812 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:59:15,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-12-07 18:59:15,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:15,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:15,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:15,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:15,813 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 359#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 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; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-12-07 18:59:15,813 INFO L796 eck$LassoCheckResult]: Loop: 339#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 351#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 337#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-12-07 18:59:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-12-07 18:59:15,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686536998] [2019-12-07 18:59:15,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:15,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686536998] [2019-12-07 18:59:15,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947131547] [2019-12-07 18:59:15,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:15,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:59:15,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:15,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:15,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 18:59:15,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833607782] [2019-12-07 18:59:15,880 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:59:15,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,880 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-12-07 18:59:15,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862242073] [2019-12-07 18:59:15,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:15,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:59:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:59:15,925 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-12-07 18:59:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:15,960 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-12-07 18:59:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:59:15,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-12-07 18:59:15,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-12-07 18:59:15,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 18:59:15,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 18:59:15,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-12-07 18:59:15,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:15,962 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-12-07 18:59:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-12-07 18:59:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-12-07 18:59:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 18:59:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-12-07 18:59:15,965 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-12-07 18:59:15,965 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-12-07 18:59:15,965 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:59:15,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-12-07 18:59:15,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:15,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:15,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:15,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:15,966 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:15,966 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 450#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 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; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-12-07 18:59:15,966 INFO L796 eck$LassoCheckResult]: Loop: 430#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 442#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 428#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-12-07 18:59:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-12-07 18:59:15,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731448330] [2019-12-07 18:59:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-12-07 18:59:15,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674186913] [2019-12-07 18:59:15,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:15,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-12-07 18:59:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33779399] [2019-12-07 18:59:15,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:16,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33779399] [2019-12-07 18:59:16,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841258337] [2019-12-07 18:59:16,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:59:16,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:59:16,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:59:16,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-12-07 18:59:16,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433201404] [2019-12-07 18:59:16,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:59:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:59:16,115 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-12-07 18:59:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:16,152 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-12-07 18:59:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:59:16,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-12-07 18:59:16,153 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:16,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-12-07 18:59:16,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 18:59:16,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-12-07 18:59:16,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-12-07 18:59:16,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:16,154 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-12-07 18:59:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-12-07 18:59:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-12-07 18:59:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 18:59:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-12-07 18:59:16,157 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-12-07 18:59:16,157 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-12-07 18:59:16,157 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:59:16,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-12-07 18:59:16,158 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 18:59:16,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:16,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:16,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:16,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:16,159 INFO L794 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 573#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 574#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 580#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 558#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 559#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L7-3 assume !(init_nondet_~i~0 < ~N~0); 560#L5 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; 550#L18-3 assume !!(rangesum_~i~1 < ~N~0); 551#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 571#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 584#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-12-07 18:59:16,159 INFO L796 eck$LassoCheckResult]: Loop: 570#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 563#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 564#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-12-07 18:59:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-12-07 18:59:16,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117983057] [2019-12-07 18:59:16,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-12-07 18:59:16,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211482794] [2019-12-07 18:59:16,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-12-07 18:59:16,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956638188] [2019-12-07 18:59:16,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:59:16,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956638188] [2019-12-07 18:59:16,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973011850] [2019-12-07 18:59:16,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:59:16,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:16,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:16,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-12-07 18:59:16,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416991201] [2019-12-07 18:59:16,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:59:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:59:16,341 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-12-07 18:59:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:16,528 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-12-07 18:59:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:59:16,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 115 transitions. [2019-12-07 18:59:16,529 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-12-07 18:59:16,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 77 states and 99 transitions. [2019-12-07 18:59:16,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-12-07 18:59:16,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-12-07 18:59:16,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2019-12-07 18:59:16,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:16,531 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2019-12-07 18:59:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2019-12-07 18:59:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-12-07 18:59:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 18:59:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-12-07 18:59:16,535 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-12-07 18:59:16,535 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-12-07 18:59:16,535 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 18:59:16,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2019-12-07 18:59:16,535 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-12-07 18:59:16,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:16,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:16,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:16,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:16,536 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 775#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 776#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 782#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 759#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 760#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 783#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 801#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 800#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 798#L7-3 assume !(init_nondet_~i~0 < ~N~0); 799#L5 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; 806#L18-3 assume !!(rangesum_~i~1 < ~N~0); 773#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 766#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 767#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-12-07 18:59:16,536 INFO L796 eck$LassoCheckResult]: Loop: 796#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 797#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 795#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-12-07 18:59:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2019-12-07 18:59:16,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608880113] [2019-12-07 18:59:16,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-12-07 18:59:16,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631144897] [2019-12-07 18:59:16,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:16,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2019-12-07 18:59:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814865560] [2019-12-07 18:59:16,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:16,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814865560] [2019-12-07 18:59:16,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68731541] [2019-12-07 18:59:16,618 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:16,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:59:16,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:59:16,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:59:16,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:16,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:16,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-12-07 18:59:16,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865875210] [2019-12-07 18:59:16,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:59:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:16,731 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-12-07 18:59:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:17,187 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-12-07 18:59:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:59:17,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2019-12-07 18:59:17,188 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-12-07 18:59:17,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 116 states and 142 transitions. [2019-12-07 18:59:17,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-12-07 18:59:17,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-12-07 18:59:17,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 142 transitions. [2019-12-07 18:59:17,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:17,190 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2019-12-07 18:59:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 142 transitions. [2019-12-07 18:59:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-12-07 18:59:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 18:59:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-12-07 18:59:17,194 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-12-07 18:59:17,194 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-12-07 18:59:17,194 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 18:59:17,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 128 transitions. [2019-12-07 18:59:17,195 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-12-07 18:59:17,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:17,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:17,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 18:59:17,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:17,196 INFO L794 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1064#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1065#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1073#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1076#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1077#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1048#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1049#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1116#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1115#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1087#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1085#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1086#L5 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; 1117#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1060#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1061#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1043#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1044#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1109#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1098#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-12-07 18:59:17,196 INFO L796 eck$LassoCheckResult]: Loop: 1101#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 1102#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1103#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-12-07 18:59:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-12-07 18:59:17,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:17,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277642263] [2019-12-07 18:59:17,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:17,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-12-07 18:59:17,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:17,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415283004] [2019-12-07 18:59:17,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:17,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-12-07 18:59:17,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:17,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933136662] [2019-12-07 18:59:17,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:59:17,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933136662] [2019-12-07 18:59:17,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288516593] [2019-12-07 18:59:17,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:17,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 18:59:17,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:59:17,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:59:17,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 18:59:17,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:17,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-12-07 18:59:17,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790889621] [2019-12-07 18:59:17,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:17,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:59:17,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:17,409 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. cyclomatic complexity: 37 Second operand 16 states. [2019-12-07 18:59:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:18,034 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2019-12-07 18:59:18,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 18:59:18,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 345 transitions. [2019-12-07 18:59:18,037 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 49 [2019-12-07 18:59:18,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 263 states and 329 transitions. [2019-12-07 18:59:18,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-12-07 18:59:18,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-12-07 18:59:18,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 329 transitions. [2019-12-07 18:59:18,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:18,042 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 329 transitions. [2019-12-07 18:59:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 329 transitions. [2019-12-07 18:59:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 112. [2019-12-07 18:59:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 18:59:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-12-07 18:59:18,047 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-12-07 18:59:18,047 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-12-07 18:59:18,048 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 18:59:18,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 139 transitions. [2019-12-07 18:59:18,048 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-12-07 18:59:18,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:18,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:18,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:18,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:18,049 INFO L794 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1600#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1601#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1608#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1610#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1611#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1612#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1622#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1587#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1588#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1589#L5 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; 1590#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1644#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1642#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1582#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1583#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1592#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1593#L18-3 assume !(rangesum_~i~1 < ~N~0); 1581#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1594#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;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; 1595#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1688#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1687#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1603#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1596#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-12-07 18:59:18,049 INFO L796 eck$LassoCheckResult]: Loop: 1597#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1605#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1689#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-12-07 18:59:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1740406288, now seen corresponding path program 1 times [2019-12-07 18:59:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:18,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130943115] [2019-12-07 18:59:18,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:59:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130943115] [2019-12-07 18:59:18,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969485826] [2019-12-07 18:59:18,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:59:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:18,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:59:18,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 18:59:18,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:59:18,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-12-07 18:59:18,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784015003] [2019-12-07 18:59:18,202 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:59:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 88159, now seen corresponding path program 1 times [2019-12-07 18:59:18,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166202735] [2019-12-07 18:59:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:18,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:18,217 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:18,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:18,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:18,218 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:18,218 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:59:18,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:18,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:18,218 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-12-07 18:59:18,218 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:18,218 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:18,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:18,274 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:18,274 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:59:18,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:59:18,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-12-07 18:59:18,280 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/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:59:18,285 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:59:18,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:59:18,819 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:59:18,822 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:18,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:18,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:18,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:18,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:59:18,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:18,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:18,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-12-07 18:59:18,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:18,822 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:18,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:18,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:18,877 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:18,877 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,885 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-12-07 18:59:18,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:18,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:18,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:18,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:18,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:18,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:18,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:18,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,892 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-12-07 18:59:18,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:18,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:18,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:18,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:18,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:18,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:18,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:18,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:59:18,900 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-12-07 18:59:18,900 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:18,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:59:18,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:59:18,902 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:59:18,903 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_rangesum_~i~1) = 1*~N~0 - 2*ULTIMATE.start_rangesum_~i~1 Supporting invariants [] [2019-12-07 18:59:18,904 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:59:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:18,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:59:18,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:18,928 WARN L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:59:18,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:18,941 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-12-07 18:59:18,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38 Second operand 4 states. [2019-12-07 18:59:18,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 144 states and 182 transitions. Complement of second has 7 states. [2019-12-07 18:59:18,971 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-12-07 18:59:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 18:59:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-12-07 18:59:18,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 18:59:18,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:18,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 3 letters. [2019-12-07 18:59:18,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:18,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 6 letters. [2019-12-07 18:59:18,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:18,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2019-12-07 18:59:18,973 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-12-07 18:59:18,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 121 states and 150 transitions. [2019-12-07 18:59:18,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-12-07 18:59:18,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2019-12-07 18:59:18,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 150 transitions. [2019-12-07 18:59:18,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:18,974 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-12-07 18:59:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 150 transitions. [2019-12-07 18:59:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2019-12-07 18:59:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 18:59:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-12-07 18:59:18,978 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-12-07 18:59:18,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:59:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:59:18,978 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 15 states. [2019-12-07 18:59:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:19,182 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2019-12-07 18:59:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:59:19,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 175 transitions. [2019-12-07 18:59:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2019-12-07 18:59:19,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 175 transitions. [2019-12-07 18:59:19,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-12-07 18:59:19,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-12-07 18:59:19,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 175 transitions. [2019-12-07 18:59:19,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:19,185 INFO L688 BuchiCegarLoop]: Abstraction has 148 states and 175 transitions. [2019-12-07 18:59:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 175 transitions. [2019-12-07 18:59:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2019-12-07 18:59:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 18:59:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-12-07 18:59:19,189 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-12-07 18:59:19,189 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-12-07 18:59:19,189 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 18:59:19,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 140 transitions. [2019-12-07 18:59:19,190 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-12-07 18:59:19,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:19,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:19,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-07 18:59:19,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 18:59:19,191 INFO L794 eck$LassoCheckResult]: Stem: 2340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2335#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2336#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 2345#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2382#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2381#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2379#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2380#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2412#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2317#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2318#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2350#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2349#L5 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; 2310#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2311#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2410#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2408#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2407#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2405#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2403#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2402#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2401#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2399#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-12-07 18:59:19,191 INFO L796 eck$LassoCheckResult]: Loop: 2385#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 2321#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2322#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-12-07 18:59:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-12-07 18:59:19,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:19,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948250066] [2019-12-07 18:59:19,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-12-07 18:59:19,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:19,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96960890] [2019-12-07 18:59:19,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,217 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-12-07 18:59:19,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:19,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74889374] [2019-12-07 18:59:19,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:19,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:19,866 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2019-12-07 18:59:19,944 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:19,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:19,944 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:19,944 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:19,944 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:59:19,944 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:19,944 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:19,944 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:19,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2019-12-07 18:59:19,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:19,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:19,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:19,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,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-12-07 18:59:20,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,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-12-07 18:59:20,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-12-07 18:59:20,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:20,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:59:20,322 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,325 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-12-07 18:59:20,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:59:20,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:59:20,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:59:20,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,332 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-12-07 18:59:20,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:20,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:20,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,342 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-12-07 18:59:20,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:20,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:20,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,356 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-12-07 18:59:20,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:20,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:20,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,367 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-12-07 18:59:20,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:20,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:20,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,378 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-12-07 18:59:20,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:59:20,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:59:20,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:59:20,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:59:20,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:59:20,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:59:20,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:59:20,444 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-12-07 18:59:20,444 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea36efaf-0011-4bf0-abe7-834cd5ce0df3/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:20,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:59:20,449 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 18:59:20,449 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:59:20,449 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2, ULTIMATE.start_rangesum_~i~1, ULTIMATE.start_rangesum_~x.offset) = 1*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2 - 4*ULTIMATE.start_rangesum_~i~1 - 1*ULTIMATE.start_rangesum_~x.offset Supporting invariants [] [2019-12-07 18:59:20,460 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 18:59:20,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 18:59:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:20,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:59:20,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:20,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:59:20,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:59:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:20,528 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-12-07 18:59:20,528 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-12-07 18:59:20,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35. Second operand 6 states. Result 149 states and 180 transitions. Complement of second has 9 states. [2019-12-07 18:59:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 18:59:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-12-07 18:59:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-12-07 18:59:20,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 18:59:20,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:20,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 28 letters. Loop has 3 letters. [2019-12-07 18:59:20,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:20,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 6 letters. [2019-12-07 18:59:20,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:59:20,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 180 transitions. [2019-12-07 18:59:20,570 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-12-07 18:59:20,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 118 states and 141 transitions. [2019-12-07 18:59:20,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-12-07 18:59:20,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-12-07 18:59:20,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 141 transitions. [2019-12-07 18:59:20,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 18:59:20,571 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-12-07 18:59:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 141 transitions. [2019-12-07 18:59:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-12-07 18:59:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 18:59:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-12-07 18:59:20,573 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-12-07 18:59:20,573 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-12-07 18:59:20,573 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 18:59:20,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2019-12-07 18:59:20,574 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-12-07 18:59:20,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:59:20,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:59:20,575 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:59:20,575 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 18:59:20,575 INFO L794 eck$LassoCheckResult]: Stem: 2747#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2740#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2741#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 2751#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2754#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2755#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2724#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2725#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2758#L5 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; 2770#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2779#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2769#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2765#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2760#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2761#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2781#L18-3 assume !(rangesum_~i~1 < ~N~0); 2780#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2778#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;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; 2777#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2776#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2775#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2771#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2768#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2764#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2763#L18-8 assume !(rangesum_~i~1 < ~N~0); 2739#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2720#L27-1 main_#t~ret8 := rangesum_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 2721#L46-3 [2019-12-07 18:59:20,575 INFO L796 eck$LassoCheckResult]: Loop: 2721#L46-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 2750#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 2721#L46-3 [2019-12-07 18:59:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-12-07 18:59:20,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:20,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345906761] [2019-12-07 18:59:20,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-12-07 18:59:20,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:20,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879989280] [2019-12-07 18:59:20,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-12-07 18:59:20,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:20,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914634874] [2019-12-07 18:59:20,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:20,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:21,058 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2019-12-07 18:59:21,207 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 18:59:21,356 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 18:59:21,526 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 18:59:21,597 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:59:21,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:59:21,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:59:21,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:59:21,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:59:21,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:59:21,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:59:21,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:59:21,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2019-12-07 18:59:21,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:59:21,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:59:21,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:59:21,649 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) 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-12-07 18:59:21,651 INFO L168 Benchmark]: Toolchain (without parser) took 7828.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 938.7 MB in the beginning and 1.2 GB in the end (delta: -235.3 MB). Peak memory consumption was 316.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:21,651 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:21,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:21,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:21,652 INFO L168 Benchmark]: Boogie Preprocessor took 20.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:21,653 INFO L168 Benchmark]: RCFGBuilder took 235.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:21,653 INFO L168 Benchmark]: BuchiAutomizer took 7349.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.3 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:21,654 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7349.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.3 MB). Peak memory consumption was 344.7 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...