./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/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.23-635dfa2 [2018-12-08 09:55:41,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:55:41,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:55:41,143 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:55:41,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:55:41,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:55:41,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:55:41,145 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:55:41,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:55:41,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:55:41,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:55:41,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:55:41,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:55:41,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:55:41,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:55:41,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:55:41,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:55:41,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:55:41,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:55:41,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:55:41,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:55:41,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:55:41,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:55:41,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:55:41,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:55:41,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:55:41,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:55:41,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:55:41,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:55:41,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:55:41,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:55:41,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:55:41,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:55:41,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:55:41,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:55:41,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:55:41,159 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 09:55:41,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:55:41,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:55:41,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:55:41,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:55:41,169 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:55:41,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:55:41,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:55:41,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:55:41,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:55:41,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:55:41,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:55:41,172 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:55:41,172 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:55:41,172 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2018-12-08 09:55:41,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:55:41,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:55:41,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:55:41,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:55:41,199 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:55:41,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-12-08 09:55:41,233 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/data/d752f7b51/57c5c0f9909343679273f5171920ec35/FLAG4c72c3c62 [2018-12-08 09:55:41,679 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:55:41,679 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-12-08 09:55:41,682 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/data/d752f7b51/57c5c0f9909343679273f5171920ec35/FLAG4c72c3c62 [2018-12-08 09:55:41,690 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/data/d752f7b51/57c5c0f9909343679273f5171920ec35 [2018-12-08 09:55:41,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:55:41,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:55:41,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:55:41,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:55:41,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:55:41,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41, skipping insertion in model container [2018-12-08 09:55:41,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:55:41,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:55:41,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:55:41,813 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:55:41,826 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:55:41,834 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:55:41,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41 WrapperNode [2018-12-08 09:55:41,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:55:41,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:55:41,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:55:41,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:55:41,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:55:41,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:55:41,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:55:41,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:55:41,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... [2018-12-08 09:55:41,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:55:41,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:55:41,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:55:41,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:55:41,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/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 [2018-12-08 09:55:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:55:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:55:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:55:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:55:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:55:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:55:42,122 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:55:42,122 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 09:55:42,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:55:42 BoogieIcfgContainer [2018-12-08 09:55:42,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:55:42,123 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:55:42,123 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:55:42,126 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:55:42,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:55:42,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:55:41" (1/3) ... [2018-12-08 09:55:42,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b05e3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:55:42, skipping insertion in model container [2018-12-08 09:55:42,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:55:42,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:55:41" (2/3) ... [2018-12-08 09:55:42,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b05e3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:55:42, skipping insertion in model container [2018-12-08 09:55:42,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:55:42,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:55:42" (3/3) ... [2018-12-08 09:55:42,130 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-12-08 09:55:42,166 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:55:42,167 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:55:42,167 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:55:42,167 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:55:42,167 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:55:42,167 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:55:42,167 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:55:42,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:55:42,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:55:42,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-12-08 09:55:42,190 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 09:55:42,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:42,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:42,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:55:42,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:55:42,194 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:55:42,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-12-08 09:55:42,196 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 09:55:42,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:42,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:42,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:55:42,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:55:42,200 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 26#L6-3true [2018-12-08 09:55:42,201 INFO L796 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2018-12-08 09:55:42,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 09:55:42,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-08 09:55:42,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-08 09:55:42,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,407 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:55:42,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:55:42,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:55:42,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:55:42,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:55:42,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:55:42,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:55:42,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:55:42,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 09:55:42,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:55:42,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:55:42,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:42,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:55:42,645 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:55:42,646 INFO L122 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 [2018-12-08 09:55:42,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,651 INFO L122 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 [2018-12-08 09:55:42,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,654 INFO L122 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 [2018-12-08 09:55:42,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,656 INFO L122 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 [2018-12-08 09:55:42,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:42,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:42,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,663 INFO L122 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 [2018-12-08 09:55:42,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,666 INFO L122 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 [2018-12-08 09:55:42,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,668 INFO L122 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 [2018-12-08 09:55:42,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,671 INFO L122 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 [2018-12-08 09:55:42,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:42,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:42,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,677 INFO L122 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 [2018-12-08 09:55:42,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,681 INFO L122 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 [2018-12-08 09:55:42,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,684 INFO L122 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 [2018-12-08 09:55:42,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,686 INFO L122 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 [2018-12-08 09:55:42,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,689 INFO L122 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 [2018-12-08 09:55:42,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:42,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:42,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:42,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:42,692 INFO L122 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 [2018-12-08 09:55:42,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:42,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:42,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:42,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:42,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:42,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:42,730 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:55:42,756 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 09:55:42,756 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 09:55:42,758 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:55:42,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:55:42,759 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:55:42,759 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1, ULTIMATE.start_init_nondet_~i~0) = 9*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0 Supporting invariants [] [2018-12-08 09:55:42,770 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 09:55:42,775 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 09:55:42,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:42,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:42,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:42,831 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 [2018-12-08 09:55:42,832 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2018-12-08 09:55:42,886 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 78 states and 122 transitions. Complement of second has 7 states. [2018-12-08 09:55:42,886 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 [2018-12-08 09:55:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:55:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-12-08 09:55:42,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-08 09:55:42,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:42,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-08 09:55:42,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:42,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 09:55:42,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:42,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2018-12-08 09:55:42,892 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:42,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2018-12-08 09:55:42,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 09:55:42,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:42,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2018-12-08 09:55:42,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:42,896 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-08 09:55:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2018-12-08 09:55:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-08 09:55:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 09:55:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-08 09:55:42,913 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-08 09:55:42,913 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-08 09:55:42,913 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:55:42,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2018-12-08 09:55:42,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:42,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:42,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:42,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:55:42,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:42,914 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 172#L6-3 assume !(init_nondet_~i~0 < 5); 175#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 158#L17-3 [2018-12-08 09:55:42,914 INFO L796 eck$LassoCheckResult]: Loop: 158#L17-3 assume !!(rangesum_~i~1 < 5); 166#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 157#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 158#L17-3 [2018-12-08 09:55:42,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-08 09:55:42,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:55:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:55:42,938 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:42,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2018-12-08 09:55:42,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:55:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:55:42,969 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-12-08 09:55:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:42,976 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2018-12-08 09:55:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:55:42,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-12-08 09:55:42,977 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:42,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2018-12-08 09:55:42,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:55:42,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:42,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2018-12-08 09:55:42,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:42,978 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-12-08 09:55:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2018-12-08 09:55:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-08 09:55:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 09:55:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-12-08 09:55:42,979 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 09:55:42,980 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-08 09:55:42,980 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:55:42,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-12-08 09:55:42,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:42,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:42,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:42,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:55:42,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:42,981 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 223#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 226#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 227#L6-3 assume !(init_nondet_~i~0 < 5); 228#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 209#L17-3 [2018-12-08 09:55:42,981 INFO L796 eck$LassoCheckResult]: Loop: 209#L17-3 assume !!(rangesum_~i~1 < 5); 217#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 208#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 209#L17-3 [2018-12-08 09:55:42,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-08 09:55:42,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:42,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:42,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:42,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:42,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 09:55:43,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:43,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2018-12-08 09:55:43,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:55:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:55:43,060 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 09:55:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,074 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-12-08 09:55:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:55:43,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-12-08 09:55:43,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2018-12-08 09:55:43,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:55:43,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:43,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-12-08 09:55:43,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,076 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-08 09:55:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-12-08 09:55:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-08 09:55:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 09:55:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-08 09:55:43,077 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 09:55:43,077 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 09:55:43,077 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:55:43,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-08 09:55:43,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-08 09:55:43,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,078 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 292#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 293#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 296#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 297#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 298#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 301#L6-3 assume !(init_nondet_~i~0 < 5); 300#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 279#L17-3 [2018-12-08 09:55:43,079 INFO L796 eck$LassoCheckResult]: Loop: 279#L17-3 assume !!(rangesum_~i~1 < 5); 287#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 278#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 279#L17-3 [2018-12-08 09:55:43,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-08 09:55:43,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:43,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:43,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 09:55:43,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 09:55:43,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:55:43,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 09:55:43,134 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2018-12-08 09:55:43,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:55:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:55:43,171 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-12-08 09:55:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,184 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-12-08 09:55:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:55:43,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-12-08 09:55:43,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2018-12-08 09:55:43,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:55:43,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:43,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-12-08 09:55:43,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,186 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-12-08 09:55:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-12-08 09:55:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-08 09:55:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 09:55:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-12-08 09:55:43,187 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 09:55:43,187 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 09:55:43,187 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 09:55:43,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-12-08 09:55:43,187 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-08 09:55:43,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,188 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 373#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 374#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 377#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 384#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 378#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 379#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 383#L6-3 assume !(init_nondet_~i~0 < 5); 382#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 360#L17-3 [2018-12-08 09:55:43,188 INFO L796 eck$LassoCheckResult]: Loop: 360#L17-3 assume !!(rangesum_~i~1 < 5); 368#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 359#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 360#L17-3 [2018-12-08 09:55:43,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-08 09:55:43,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:43,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 09:55:43,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 09:55:43,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:55:43,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-08 09:55:43,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:43,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2018-12-08 09:55:43,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:55:43,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:55:43,283 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-12-08 09:55:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,299 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-08 09:55:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:55:43,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-12-08 09:55:43,299 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2018-12-08 09:55:43,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:55:43,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:43,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-12-08 09:55:43,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,300 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-08 09:55:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-12-08 09:55:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-08 09:55:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 09:55:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-08 09:55:43,302 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 09:55:43,302 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-08 09:55:43,302 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 09:55:43,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-12-08 09:55:43,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-08 09:55:43,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,304 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 465#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 466#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 469#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 470#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 471#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 478#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 477#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 476#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 475#L6-3 assume !(init_nondet_~i~0 < 5); 474#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 452#L17-3 [2018-12-08 09:55:43,304 INFO L796 eck$LassoCheckResult]: Loop: 452#L17-3 assume !!(rangesum_~i~1 < 5); 460#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 451#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 452#L17-3 [2018-12-08 09:55:43,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-08 09:55:43,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:43,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:43,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 09:55:43,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 09:55:43,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:55:43,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:43,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 09:55:43,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:43,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2018-12-08 09:55:43,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:55:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:55:43,416 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-12-08 09:55:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,429 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-08 09:55:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:55:43,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-08 09:55:43,430 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2018-12-08 09:55:43,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:55:43,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 09:55:43,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-12-08 09:55:43,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,431 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-08 09:55:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-12-08 09:55:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-08 09:55:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 09:55:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-12-08 09:55:43,432 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-08 09:55:43,432 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-08 09:55:43,432 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 09:55:43,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2018-12-08 09:55:43,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-08 09:55:43,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,433 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 567#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 568#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 571#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 572#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 573#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 582#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 581#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 580#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 579#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 578#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 577#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 576#L6-3 assume !(init_nondet_~i~0 < 5); 575#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 554#L17-3 [2018-12-08 09:55:43,433 INFO L796 eck$LassoCheckResult]: Loop: 554#L17-3 assume !!(rangesum_~i~1 < 5); 562#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 553#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 554#L17-3 [2018-12-08 09:55:43,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-08 09:55:43,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2018-12-08 09:55:43,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2018-12-08 09:55:43,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 09:55:43,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:55:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:55:43,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:55:43,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:55:43,491 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 09:55:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,513 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-08 09:55:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:55:43,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-12-08 09:55:43,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2018-12-08 09:55:43,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 09:55:43,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-08 09:55:43,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2018-12-08 09:55:43,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,515 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-12-08 09:55:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2018-12-08 09:55:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-08 09:55:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 09:55:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-12-08 09:55:43,517 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-08 09:55:43,517 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-08 09:55:43,517 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 09:55:43,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-12-08 09:55:43,517 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-12-08 09:55:43,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,518 INFO L794 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 645#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 646#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 650#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 651#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 652#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 655#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 664#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 662#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 661#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 660#L6-3 assume !!(init_nondet_~i~0 < 5);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; 658#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 657#L6-3 assume !(init_nondet_~i~0 < 5); 656#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 653#L17-3 assume !!(rangesum_~i~1 < 5); 640#L18 assume !(rangesum_~i~1 > 2); 630#L17-2 [2018-12-08 09:55:43,518 INFO L796 eck$LassoCheckResult]: Loop: 630#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 631#L17-3 assume !!(rangesum_~i~1 < 5); 663#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 630#L17-2 [2018-12-08 09:55:43,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2018-12-08 09:55:43,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2018-12-08 09:55:43,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2018-12-08 09:55:43,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 09:55:43,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:43,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 09:55:43,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-12-08 09:55:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:55:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:55:43,626 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-08 09:55:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,669 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-12-08 09:55:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:55:43,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2018-12-08 09:55:43,670 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2018-12-08 09:55:43,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-08 09:55:43,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-08 09:55:43,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2018-12-08 09:55:43,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,670 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-12-08 09:55:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2018-12-08 09:55:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-12-08 09:55:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 09:55:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-08 09:55:43,672 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-08 09:55:43,672 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-08 09:55:43,672 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 09:55:43,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-12-08 09:55:43,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:55:43,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,673 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 795#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 796#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 800#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 801#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 802#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 818#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 817#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 813#L6-3 assume !!(init_nondet_~i~0 < 5);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; 812#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 811#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 808#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 807#L6-3 assume !(init_nondet_~i~0 < 5); 805#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 806#L17-3 assume !!(rangesum_~i~1 < 5); 819#L18 assume !(rangesum_~i~1 > 2); 778#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 779#L17-3 assume !!(rangesum_~i~1 < 5); 788#L18 assume !(rangesum_~i~1 > 2); 789#L17-2 [2018-12-08 09:55:43,673 INFO L796 eck$LassoCheckResult]: Loop: 789#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 815#L17-3 assume !!(rangesum_~i~1 < 5); 816#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 789#L17-2 [2018-12-08 09:55:43,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2018-12-08 09:55:43,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2018-12-08 09:55:43,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2018-12-08 09:55:43,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 09:55:43,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:43,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:43,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 09:55:43,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 09:55:43,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:55:43,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 09:55:43,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:55:43,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 09:55:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:55:43,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:55:43,778 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-12-08 09:55:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:43,811 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-12-08 09:55:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:55:43,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-12-08 09:55:43,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-12-08 09:55:43,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2018-12-08 09:55:43,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-08 09:55:43,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-08 09:55:43,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2018-12-08 09:55:43,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:55:43,813 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-12-08 09:55:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2018-12-08 09:55:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-12-08 09:55:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 09:55:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-08 09:55:43,814 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-08 09:55:43,814 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-08 09:55:43,814 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 09:55:43,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2018-12-08 09:55:43,815 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 09:55:43,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:43,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:43,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2018-12-08 09:55:43,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:43,815 INFO L794 eck$LassoCheckResult]: Stem: 972#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 969#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 970#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 974#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 975#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 976#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 995#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 993#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 990#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 989#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 987#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 984#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 983#L6-3 assume !(init_nondet_~i~0 < 5); 980#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 981#L17-3 assume !!(rangesum_~i~1 < 5); 964#L18 assume !(rangesum_~i~1 > 2); 954#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 955#L17-3 assume !!(rangesum_~i~1 < 5); 977#L18 assume !(rangesum_~i~1 > 2); 998#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 997#L17-3 assume !!(rangesum_~i~1 < 5); 996#L18 assume !(rangesum_~i~1 > 2); 994#L17-2 [2018-12-08 09:55:43,815 INFO L796 eck$LassoCheckResult]: Loop: 994#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 991#L17-3 assume !!(rangesum_~i~1 < 5); 992#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 994#L17-2 [2018-12-08 09:55:43,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2018-12-08 09:55:43,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2018-12-08 09:55:43,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2018-12-08 09:55:43,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:44,277 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2018-12-08 09:55:44,323 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:55:44,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:55:44,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:55:44,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:55:44,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:55:44,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:55:44,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:55:44,324 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:55:44,324 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration10_Lasso [2018-12-08 09:55:44,324 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:55:44,324 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:55:44,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,600 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:55:44,601 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:55:44,601 INFO L122 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 [2018-12-08 09:55:44,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:44,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:44,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:44,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:44,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:44,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:44,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:44,605 INFO L122 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 [2018-12-08 09:55:44,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:44,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:44,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:44,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:44,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:44,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:44,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:44,607 INFO L122 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 [2018-12-08 09:55:44,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:44,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:55:44,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:44,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:44,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:55:44,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:44,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:44,612 INFO L122 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 [2018-12-08 09:55:44,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:44,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:44,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:44,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:44,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:44,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:44,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:44,614 INFO L122 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 [2018-12-08 09:55:44,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:44,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:44,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:44,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:44,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:55:44,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:55:44,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:55:44,629 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 09:55:44,629 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 09:55:44,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:55:44,630 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:55:44,630 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:55:44,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 7 Supporting invariants [] [2018-12-08 09:55:44,637 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-08 09:55:44,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:44,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:44,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:44,680 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 [2018-12-08 09:55:44,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-12-08 09:55:44,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 7 states. [2018-12-08 09:55:44,704 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 [2018-12-08 09:55:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:55:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-08 09:55:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2018-12-08 09:55:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:44,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2018-12-08 09:55:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:44,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2018-12-08 09:55:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:44,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2018-12-08 09:55:44,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 09:55:44,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2018-12-08 09:55:44,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-08 09:55:44,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-08 09:55:44,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-12-08 09:55:44,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:55:44,707 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-08 09:55:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-12-08 09:55:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 09:55:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 09:55:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-08 09:55:44,708 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-08 09:55:44,708 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-08 09:55:44,708 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 09:55:44,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2018-12-08 09:55:44,709 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 09:55:44,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:44,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:44,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:55:44,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:44,709 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1208#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1209#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1213#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1214#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1215#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1237#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1236#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1235#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1234#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1233#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1232#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1231#L6-3 assume !(init_nondet_~i~0 < 5); 1218#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1216#L17-3 assume !!(rangesum_~i~1 < 5); 1201#L18 assume !(rangesum_~i~1 > 2); 1189#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1190#L17-3 assume !!(rangesum_~i~1 < 5); 1202#L18 assume !(rangesum_~i~1 > 2); 1203#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1228#L17-3 assume !!(rangesum_~i~1 < 5); 1226#L18 assume !(rangesum_~i~1 > 2); 1223#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1221#L17-3 assume !(rangesum_~i~1 < 5); 1212#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1193#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1194#L17-8 assume !!(rangesum_~i~1 < 5); 1197#L18-2 assume !(rangesum_~i~1 > 2); 1198#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1210#L17-8 assume !!(rangesum_~i~1 < 5); 1230#L18-2 assume !(rangesum_~i~1 > 2); 1229#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1227#L17-8 assume !!(rangesum_~i~1 < 5); 1224#L18-2 assume !(rangesum_~i~1 > 2); 1222#L17-7 [2018-12-08 09:55:44,709 INFO L796 eck$LassoCheckResult]: Loop: 1222#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1219#L17-8 assume !!(rangesum_~i~1 < 5); 1220#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1222#L17-7 [2018-12-08 09:55:44,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2018-12-08 09:55:44,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:44,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 09:55:44,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:55:44,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:55:44,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:44,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2018-12-08 09:55:44,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:44,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:44,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:44,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:44,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:55:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:55:44,755 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-08 09:55:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:44,782 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-12-08 09:55:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:55:44,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2018-12-08 09:55:44,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-12-08 09:55:44,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2018-12-08 09:55:44,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-08 09:55:44,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-08 09:55:44,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2018-12-08 09:55:44,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:55:44,784 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-12-08 09:55:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2018-12-08 09:55:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-12-08 09:55:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 09:55:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-12-08 09:55:44,787 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-08 09:55:44,787 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-08 09:55:44,787 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 09:55:44,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2018-12-08 09:55:44,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-08 09:55:44,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:44,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:44,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:55:44,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:44,789 INFO L794 eck$LassoCheckResult]: Stem: 1345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1342#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1343#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1347#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1348#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1349#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1355#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1368#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1367#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !!(init_nondet_~i~0 < 5);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; 1363#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1362#L6-3 assume !(init_nondet_~i~0 < 5); 1356#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1350#L17-3 assume !!(rangesum_~i~1 < 5); 1335#L18 assume !(rangesum_~i~1 > 2); 1323#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1324#L17-3 assume !!(rangesum_~i~1 < 5); 1373#L18 assume !(rangesum_~i~1 > 2); 1374#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1375#L17-3 assume !!(rangesum_~i~1 < 5); 1336#L18 assume !(rangesum_~i~1 > 2); 1325#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1326#L17-3 assume !!(rangesum_~i~1 < 5); 1351#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1361#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1359#L17-3 assume !(rangesum_~i~1 < 5); 1346#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1327#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1328#L17-8 assume !!(rangesum_~i~1 < 5); 1372#L18-2 assume !(rangesum_~i~1 > 2); 1344#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1341#L17-8 assume !!(rangesum_~i~1 < 5); 1331#L18-2 assume !(rangesum_~i~1 > 2); 1332#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1371#L17-8 assume !!(rangesum_~i~1 < 5); 1370#L18-2 assume !(rangesum_~i~1 > 2); 1364#L17-7 [2018-12-08 09:55:44,789 INFO L796 eck$LassoCheckResult]: Loop: 1364#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1369#L17-8 assume !!(rangesum_~i~1 < 5); 1358#L18-2 assume !(rangesum_~i~1 > 2); 1364#L17-7 [2018-12-08 09:55:44,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2018-12-08 09:55:44,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 09:55:44,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:55:44,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:55:44,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:44,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-08 09:55:44,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:55:44,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-08 09:55:44,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:55:44,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:44,865 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2018-12-08 09:55:44,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:44,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:44,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:44,877 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:55:44,877 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:55:44,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:55:44,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:55:44,878 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 09:55:44,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:55:44,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:55:44,878 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:55:44,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2018-12-08 09:55:44,878 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:55:44,878 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:55:44,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:55:44,893 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/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 [2018-12-08 09:55:44,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 09:55:44,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 09:55:44,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 09:55:44,899 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/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 [2018-12-08 09:55:44,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 09:55:44,915 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/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 [2018-12-08 09:55:44,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 09:55:44,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 09:55:44,971 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 09:55:44,972 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:55:44,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:55:44,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:55:44,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:55:44,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:55:44,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:55:44,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:55:44,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:55:44,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration12_Loop [2018-12-08 09:55:44,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:55:44,973 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:55:44,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:44,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:45,003 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:55:45,003 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:55:45,004 INFO L122 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 [2018-12-08 09:55:45,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:45,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:45,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:45,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:45,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:45,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:45,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:45,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:55:45,006 INFO L122 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 [2018-12-08 09:55:45,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:55:45,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:55:45,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:55:45,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:55:45,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:55:45,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:55:45,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:55:45,008 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:55:45,009 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:55:45,009 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 09:55:45,009 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:55:45,009 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 09:55:45,009 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:55:45,010 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2018-12-08 09:55:45,010 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 09:55:45,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:45,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:55:45,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:55:45,050 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 [2018-12-08 09:55:45,050 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-08 09:55:45,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 71 states and 83 transitions. Complement of second has 5 states. [2018-12-08 09:55:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:55:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:55:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-12-08 09:55:45,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2018-12-08 09:55:45,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:45,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2018-12-08 09:55:45,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:45,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2018-12-08 09:55:45,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:55:45,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2018-12-08 09:55:45,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 09:55:45,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2018-12-08 09:55:45,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-08 09:55:45,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-08 09:55:45,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2018-12-08 09:55:45,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:55:45,072 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-12-08 09:55:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2018-12-08 09:55:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-08 09:55:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 09:55:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-12-08 09:55:45,074 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-08 09:55:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:55:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:55:45,074 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 7 states. [2018-12-08 09:55:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:45,211 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-12-08 09:55:45,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:55:45,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 107 transitions. [2018-12-08 09:55:45,212 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-08 09:55:45,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 104 transitions. [2018-12-08 09:55:45,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-08 09:55:45,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-08 09:55:45,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 104 transitions. [2018-12-08 09:55:45,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:55:45,213 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-12-08 09:55:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 104 transitions. [2018-12-08 09:55:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2018-12-08 09:55:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 09:55:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-12-08 09:55:45,217 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-12-08 09:55:45,217 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-12-08 09:55:45,217 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 09:55:45,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2018-12-08 09:55:45,217 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 09:55:45,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:45,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:45,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:55:45,219 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 09:55:45,219 INFO L794 eck$LassoCheckResult]: Stem: 1897#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1893#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1894#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1899#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1900#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1901#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1926#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1925#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1924#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1922#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1921#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1918#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1917#L6-3 assume !(init_nondet_~i~0 < 5); 1906#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1907#L17-3 assume !!(rangesum_~i~1 < 5); 1885#L18 assume !(rangesum_~i~1 > 2); 1871#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1872#L17-3 assume !!(rangesum_~i~1 < 5); 1886#L18 assume !(rangesum_~i~1 > 2); 1873#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1874#L17-3 assume !!(rangesum_~i~1 < 5); 1903#L18 assume !(rangesum_~i~1 > 2); 1913#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1930#L17-3 assume !!(rangesum_~i~1 < 5); 1928#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1912#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1914#L17-3 assume !!(rangesum_~i~1 < 5); 1911#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1910#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1902#L17-3 assume !(rangesum_~i~1 < 5); 1898#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1875#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1876#L17-8 assume !!(rangesum_~i~1 < 5); 1879#L18-2 assume !(rangesum_~i~1 > 2); 1880#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1895#L17-8 assume !!(rangesum_~i~1 < 5); 1881#L18-2 assume !(rangesum_~i~1 > 2); 1882#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1931#L17-8 assume !!(rangesum_~i~1 < 5); 1929#L18-2 assume !(rangesum_~i~1 > 2); 1927#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1923#L17-8 assume !!(rangesum_~i~1 < 5); 1920#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1919#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1916#L17-8 assume !!(rangesum_~i~1 < 5); 1909#L18-2 [2018-12-08 09:55:45,219 INFO L796 eck$LassoCheckResult]: Loop: 1909#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1915#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1908#L17-8 assume !!(rangesum_~i~1 < 5); 1909#L18-2 [2018-12-08 09:55:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2018-12-08 09:55:45,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,227 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 09:55:45,227 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 09:55:45,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 09:55:45,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2018-12-08 09:55:45,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2018-12-08 09:55:45,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,329 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 09:55:45,330 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 09:55:45,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 09:55:45,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 09:55:45,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 09:55:45,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:55:45,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:55:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 09:55:45,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:55:45,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:55:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:55:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:55:45,418 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 09:55:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:55:45,458 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-12-08 09:55:45,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:55:45,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2018-12-08 09:55:45,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-08 09:55:45,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2018-12-08 09:55:45,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-08 09:55:45,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-08 09:55:45,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2018-12-08 09:55:45,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:55:45,460 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-12-08 09:55:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2018-12-08 09:55:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-12-08 09:55:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 09:55:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-08 09:55:45,462 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-08 09:55:45,462 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-08 09:55:45,462 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-08 09:55:45,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-12-08 09:55:45,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-08 09:55:45,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:55:45,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:55:45,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:55:45,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:55:45,464 INFO L794 eck$LassoCheckResult]: Stem: 2191#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2188#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2189#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2193#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2194#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2195#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2222#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2221#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2220#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2219#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2218#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2217#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2216#L6-3 assume !(init_nondet_~i~0 < 5); 2198#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2196#L17-3 assume !!(rangesum_~i~1 < 5); 2180#L18 assume !(rangesum_~i~1 > 2); 2167#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2168#L17-3 assume !!(rangesum_~i~1 < 5); 2181#L18 assume !(rangesum_~i~1 > 2); 2169#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2170#L17-3 assume !!(rangesum_~i~1 < 5); 2215#L18 assume !(rangesum_~i~1 > 2); 2212#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2214#L17-3 assume !!(rangesum_~i~1 < 5); 2211#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2209#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2207#L17-3 assume !!(rangesum_~i~1 < 5); 2205#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2203#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2201#L17-3 assume !(rangesum_~i~1 < 5); 2192#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2171#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2172#L17-8 assume !!(rangesum_~i~1 < 5); 2175#L18-2 assume !(rangesum_~i~1 > 2); 2176#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2190#L17-8 assume !!(rangesum_~i~1 < 5); 2177#L18-2 assume !(rangesum_~i~1 > 2); 2178#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2186#L17-8 assume !!(rangesum_~i~1 < 5); 2187#L18-2 assume !(rangesum_~i~1 > 2); 2213#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2210#L17-8 assume !!(rangesum_~i~1 < 5); 2208#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2206#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2204#L17-8 assume !!(rangesum_~i~1 < 5); 2202#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2200#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2199#L17-8 assume !(rangesum_~i~1 < 5); 2182#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2183#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 2184#L43-3 [2018-12-08 09:55:45,464 INFO L796 eck$LassoCheckResult]: Loop: 2184#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 2185#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 2184#L43-3 [2018-12-08 09:55:45,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2018-12-08 09:55:45,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:55:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 09:55:45,470 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 09:55:45,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 09:55:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-12-08 09:55:45,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:55:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2018-12-08 09:55:45,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:55:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:55:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:55:45,559 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-08 09:55:45,559 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 09:55:45,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b595a32-fc56-4127-b570-e5d31cf62827/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 09:55:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:55:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:55:47,588 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 336 DAG size of output: 252 [2018-12-08 09:55:57,708 WARN L180 SmtUtils]: Spent 9.35 s on a formula simplification. DAG size of input: 305 DAG size of output: 150 [2018-12-08 09:55:57,710 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:55:57,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:55:57,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:55:57,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:55:57,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:55:57,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:55:57,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:55:57,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:55:57,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-08 09:55:57,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:55:57,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:55:57,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 09:55:57,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:55:57,989 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) 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:958) 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:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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) [2018-12-08 09:55:57,990 INFO L168 Benchmark]: Toolchain (without parser) took 16298.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 391.1 MB). Free memory was 962.4 MB in the beginning and 903.3 MB in the end (delta: 59.1 MB). Peak memory consumption was 545.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,991 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:55:57,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.39 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,992 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,992 INFO L168 Benchmark]: RCFGBuilder took 209.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,992 INFO L168 Benchmark]: BuchiAutomizer took 15866.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.8 MB). Free memory was 1.1 GB in the beginning and 903.3 MB in the end (delta: 196.4 MB). Peak memory consumption was 557.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:55:57,994 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.39 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 950.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15866.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.8 MB). Free memory was 1.1 GB in the beginning and 903.3 MB in the end (delta: 196.4 MB). Peak memory consumption was 557.6 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...