./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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_c616f921-70e0-43e7-a469-56b3c043aca8/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-1dbac8b [2018-11-10 04:37:13,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:37:13,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:37:13,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:37:13,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:37:13,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:37:13,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:37:13,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:37:13,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:37:13,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:37:13,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:37:13,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:37:13,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:37:13,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:37:13,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:37:13,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:37:13,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:37:13,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:37:13,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:37:13,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:37:13,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:37:13,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:37:13,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:37:13,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:37:13,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:37:13,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:37:13,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:37:13,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:37:13,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:37:13,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:37:13,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:37:13,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:37:13,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:37:13,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:37:13,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:37:13,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:37:13,182 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:37:13,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:37:13,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:37:13,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:37:13,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:37:13,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:37:13,192 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:37:13,192 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:37:13,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:37:13,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:37:13,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:37:13,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:37:13,195 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:37:13,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:37:13,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:37:13,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:37:13,195 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:37:13,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:37:13,196 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:37:13,196 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:37:13,197 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:37:13,197 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_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:13,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:37:13,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:37:13,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:37:13,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:37:13,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:37:13,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-10 04:37:13,297 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/data/bc8c566fd/cd9dd5b05ed64315a28970b17368a692/FLAG3da794ec3 [2018-11-10 04:37:13,659 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:37:13,659 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/sv-benchmarks/c/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-10 04:37:13,664 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/data/bc8c566fd/cd9dd5b05ed64315a28970b17368a692/FLAG3da794ec3 [2018-11-10 04:37:13,677 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/data/bc8c566fd/cd9dd5b05ed64315a28970b17368a692 [2018-11-10 04:37:13,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:37:13,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:37:13,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:37:13,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:37:13,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:37:13,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f185800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13, skipping insertion in model container [2018-11-10 04:37:13,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:37:13,722 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:37:13,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:37:13,860 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:37:13,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:37:13,892 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:37:13,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13 WrapperNode [2018-11-10 04:37:13,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:37:13,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:37:13,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:37:13,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:37:13,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:37:13,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:37:13,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:37:13,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:37:13,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... [2018-11-10 04:37:13,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:37:13,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:37:13,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:37:13,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:37:13,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:37:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:37:14,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:37:14,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:37:14,452 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:37:14,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:37:14 BoogieIcfgContainer [2018-11-10 04:37:14,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:37:14,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:37:14,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:37:14,456 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:37:14,457 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:14,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:37:13" (1/3) ... [2018-11-10 04:37:14,457 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b2add71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:37:14, skipping insertion in model container [2018-11-10 04:37:14,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:14,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:37:13" (2/3) ... [2018-11-10 04:37:14,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b2add71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:37:14, skipping insertion in model container [2018-11-10 04:37:14,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:37:14,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:37:14" (3/3) ... [2018-11-10 04:37:14,459 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-11-10 04:37:14,511 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:37:14,512 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:37:14,512 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:37:14,512 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:37:14,512 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:37:14,512 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:37:14,512 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:37:14,513 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:37:14,513 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:37:14,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 04:37:14,540 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-11-10 04:37:14,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:14,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:14,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:37:14,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:37:14,546 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:37:14,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 04:37:14,548 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-11-10 04:37:14,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:14,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:14,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 04:37:14,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:37:14,555 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 52#L6-4true [2018-11-10 04:37:14,555 INFO L795 eck$LassoCheckResult]: Loop: 52#L6-4true assume true; 44#L6-1true assume !!(init_nondet_~i~0 < 5); 7#L7true SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5#L7-1true havoc init_nondet_#t~nondet1; 54#L6-3true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 52#L6-4true [2018-11-10 04:37:14,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 04:37:14,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 04:37:14,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:14,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:14,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:14,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 04:37:14,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:14,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:14,855 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:14,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:14,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:14,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:14,856 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:37:14,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:14,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:14,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:14,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 04:37:14,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:14,857 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:14,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-11-10 04:37:14,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:14,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,063 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-10 04:37:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,380 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:15,385 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:37:15,388 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-11-10 04:37:15,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,398 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-11-10 04:37:15,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,402 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-11-10 04:37:15,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,405 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-11-10 04:37:15,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,415 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-11-10 04:37:15,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,420 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-11-10 04:37:15,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,423 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-11-10 04:37:15,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,431 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-11-10 04:37:15,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,434 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-11-10 04:37:15,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,437 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-11-10 04:37:15,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,443 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-11-10 04:37:15,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,447 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-11-10 04:37:15,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,450 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-11-10 04:37:15,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,452 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-11-10 04:37:15,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,455 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-11-10 04:37:15,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,465 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-11-10 04:37:15,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,475 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-11-10 04:37:15,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,491 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-11-10 04:37:15,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,500 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-11-10 04:37:15,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,500 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:37:15,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,503 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:37:15,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,518 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-11-10 04:37:15,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:15,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:15,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:15,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:15,522 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-11-10 04:37:15,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:15,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:15,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:15,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:15,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:15,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:15,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:37:15,599 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:37:15,600 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 04:37:15,601 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:37:15,603 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:37:15,603 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:37:15,604 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0) = -2*ULTIMATE.start_init_nondet_~i~0 + 9 Supporting invariants [] [2018-11-10 04:37:15,619 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 04:37:15,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:15,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:15,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:15,684 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-11-10 04:37:15,684 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states. Second operand 4 states. [2018-11-10 04:37:15,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states.. Second operand 4 states. Result 153 states and 195 transitions. Complement of second has 7 states. [2018-11-10 04:37:15,748 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-11-10 04:37:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:37:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-10 04:37:15,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 04:37:15,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:15,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 04:37:15,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:15,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 04:37:15,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:15,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 195 transitions. [2018-11-10 04:37:15,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:15,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 49 states and 59 transitions. [2018-11-10 04:37:15,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 04:37:15,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 04:37:15,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 59 transitions. [2018-11-10 04:37:15,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:15,763 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 04:37:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 59 transitions. [2018-11-10 04:37:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 04:37:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 04:37:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-10 04:37:15,787 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 04:37:15,787 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 04:37:15,787 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:37:15,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 59 transitions. [2018-11-10 04:37:15,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:15,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:15,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:15,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 04:37:15,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:37:15,790 INFO L793 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 288#L6-4 assume true; 301#L6-1 assume !(init_nondet_~i~0 < 5); 302#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 315#L17-4 [2018-11-10 04:37:15,790 INFO L795 eck$LassoCheckResult]: Loop: 315#L17-4 assume true; 304#L17-1 assume !!(rangesum_~i~1 < 5); 281#L18 assume !(rangesum_~i~1 > 2); 282#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 315#L17-4 [2018-11-10 04:37:15,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-11-10 04:37:15,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:15,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:37:15,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:37:15,830 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:15,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1636744, now seen corresponding path program 1 times [2018-11-10 04:37:15,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:15,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:15,866 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:15,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:15,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:15,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:15,866 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:37:15,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:15,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:15,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:15,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 04:37:15,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:15,867 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:15,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:15,887 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:15,887 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:15,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:37:15,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:37:15,900 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:37:15,900 INFO L446 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_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:15,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:37:15,945 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 04:37:15,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:37:15,995 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:16,026 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:37:16,027 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:16,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:16,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:16,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:16,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:37:16,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:16,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:16,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:16,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 04:37:16,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:16,029 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:16,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:16,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:16,075 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:16,075 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:37:16,075 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-11-10 04:37:16,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:16,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:16,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:16,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:16,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:16,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:16,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:16,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:16,078 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-11-10 04:37:16,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:16,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:16,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:16,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:16,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:16,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:16,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:16,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:37:16,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:37:16,082 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:37:16,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:37:16,083 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:37:16,083 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:37:16,083 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 5 Supporting invariants [] [2018-11-10 04:37:16,084 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:37:16,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,150 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-11-10 04:37:16,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 04:37:16,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 69 states and 83 transitions. Complement of second has 7 states. [2018-11-10 04:37:16,200 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-11-10 04:37:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:37:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 04:37:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-10 04:37:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-10 04:37:16,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:16,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-10 04:37:16,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:16,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2018-11-10 04:37:16,206 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 72 transitions. [2018-11-10 04:37:16,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:16,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 04:37:16,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 72 transitions. [2018-11-10 04:37:16,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:16,208 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-10 04:37:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 72 transitions. [2018-11-10 04:37:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-10 04:37:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:37:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-11-10 04:37:16,212 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-10 04:37:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:37:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:37:16,216 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 3 states. [2018-11-10 04:37:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:16,246 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-10 04:37:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:37:16,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 74 transitions. [2018-11-10 04:37:16,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 73 transitions. [2018-11-10 04:37:16,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:16,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:37:16,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-10 04:37:16,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:16,250 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-10 04:37:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-10 04:37:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-10 04:37:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 04:37:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-10 04:37:16,254 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-10 04:37:16,254 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-10 04:37:16,254 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:37:16,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 69 transitions. [2018-11-10 04:37:16,255 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:16,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:16,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,256 INFO L793 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 579#L6-4 assume true; 594#L6-1 assume !!(init_nondet_~i~0 < 5); 569#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 564#L7-1 havoc init_nondet_#t~nondet1; 565#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 609#L6-4 assume true; 592#L6-1 assume !(init_nondet_~i~0 < 5); 593#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 612#L17-4 assume true; 596#L17-1 [2018-11-10 04:37:16,256 INFO L795 eck$LassoCheckResult]: Loop: 596#L17-1 assume !!(rangesum_~i~1 < 5); 570#L18 assume rangesum_~i~1 > 2; 571#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 600#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 601#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 610#L17-4 assume true; 596#L17-1 [2018-11-10 04:37:16,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1918637389, now seen corresponding path program 1 times [2018-11-10 04:37:16,257 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:16,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:16,297 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 04:37:16,371 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 1 times [2018-11-10 04:37:16,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:37:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:37:16,456 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-10 04:37:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:16,488 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-10 04:37:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:37:16,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 79 transitions. [2018-11-10 04:37:16,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 78 transitions. [2018-11-10 04:37:16,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:16,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:37:16,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 78 transitions. [2018-11-10 04:37:16,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:16,492 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-10 04:37:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 78 transitions. [2018-11-10 04:37:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-10 04:37:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 04:37:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-10 04:37:16,495 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-10 04:37:16,496 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-10 04:37:16,496 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:37:16,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-11-10 04:37:16,497 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:16,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:16,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,498 INFO L793 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 742#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 743#L6-4 assume true; 773#L6-1 assume !!(init_nondet_~i~0 < 5); 782#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 781#L7-1 havoc init_nondet_#t~nondet1; 777#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 774#L6-4 assume true; 758#L6-1 assume !!(init_nondet_~i~0 < 5); 730#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 725#L7-1 havoc init_nondet_#t~nondet1; 726#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 780#L6-4 assume true; 756#L6-1 assume !(init_nondet_~i~0 < 5); 757#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 778#L17-4 assume true; 759#L17-1 [2018-11-10 04:37:16,498 INFO L795 eck$LassoCheckResult]: Loop: 759#L17-1 assume !!(rangesum_~i~1 < 5); 734#L18 assume rangesum_~i~1 > 2; 735#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 764#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 765#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 775#L17-4 assume true; 759#L17-1 [2018-11-10 04:37:16,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1300936330, now seen corresponding path program 2 times [2018-11-10 04:37:16,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:16,532 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:16,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:37:16,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:37:16,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:37:16,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:16,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:37:16,618 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:16,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 2 times [2018-11-10 04:37:16,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:16,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:37:16,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:37:16,664 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-10 04:37:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:16,688 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-10 04:37:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:37:16,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 84 transitions. [2018-11-10 04:37:16,692 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 83 transitions. [2018-11-10 04:37:16,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:16,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:37:16,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2018-11-10 04:37:16,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:16,693 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-10 04:37:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2018-11-10 04:37:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 04:37:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 04:37:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 04:37:16,697 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 04:37:16,697 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 04:37:16,697 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:37:16,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-11-10 04:37:16,698 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:16,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:16,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,699 INFO L793 eck$LassoCheckResult]: Stem: 961#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 933#L6-4 assume true; 963#L6-1 assume !!(init_nondet_~i~0 < 5); 977#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 976#L7-1 havoc init_nondet_#t~nondet1; 975#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 964#L6-4 assume true; 948#L6-1 assume !!(init_nondet_~i~0 < 5); 920#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 915#L7-1 havoc init_nondet_#t~nondet1; 916#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 967#L6-4 assume true; 971#L6-1 assume !!(init_nondet_~i~0 < 5); 974#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 973#L7-1 havoc init_nondet_#t~nondet1; 972#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 970#L6-4 assume true; 946#L6-1 assume !(init_nondet_~i~0 < 5); 947#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 968#L17-4 assume true; 949#L17-1 [2018-11-10 04:37:16,699 INFO L795 eck$LassoCheckResult]: Loop: 949#L17-1 assume !!(rangesum_~i~1 < 5); 924#L18 assume rangesum_~i~1 > 2; 925#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 954#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 955#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 965#L17-4 assume true; 949#L17-1 [2018-11-10 04:37:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1668305773, now seen corresponding path program 3 times [2018-11-10 04:37:16,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:16,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:16,746 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 04:37:16,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 04:37:16,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:37:16,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:16,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 04:37:16,820 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:16,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 3 times [2018-11-10 04:37:16,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:37:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:37:16,861 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-10 04:37:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:16,889 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-10 04:37:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:37:16,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 89 transitions. [2018-11-10 04:37:16,891 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 88 transitions. [2018-11-10 04:37:16,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:16,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:37:16,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 88 transitions. [2018-11-10 04:37:16,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:16,892 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-10 04:37:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 88 transitions. [2018-11-10 04:37:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-10 04:37:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 04:37:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-10 04:37:16,898 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-10 04:37:16,898 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-10 04:37:16,898 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:37:16,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 84 transitions. [2018-11-10 04:37:16,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:16,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:16,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:16,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:16,900 INFO L793 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1149#L6-4 assume true; 1164#L6-1 assume !!(init_nondet_~i~0 < 5); 1136#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1131#L7-1 havoc init_nondet_#t~nondet1; 1132#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1179#L6-4 assume true; 1180#L6-1 assume !!(init_nondet_~i~0 < 5); 1198#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1197#L7-1 havoc init_nondet_#t~nondet1; 1196#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1195#L6-4 assume true; 1194#L6-1 assume !!(init_nondet_~i~0 < 5); 1193#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1192#L7-1 havoc init_nondet_#t~nondet1; 1191#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1190#L6-4 assume true; 1186#L6-1 assume !!(init_nondet_~i~0 < 5); 1189#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1188#L7-1 havoc init_nondet_#t~nondet1; 1187#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1185#L6-4 assume true; 1162#L6-1 assume !(init_nondet_~i~0 < 5); 1163#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1183#L17-4 assume true; 1165#L17-1 [2018-11-10 04:37:16,900 INFO L795 eck$LassoCheckResult]: Loop: 1165#L17-1 assume !!(rangesum_~i~1 < 5); 1140#L18 assume rangesum_~i~1 > 2; 1141#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1170#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1171#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1181#L17-4 assume true; 1165#L17-1 [2018-11-10 04:37:16,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -335000470, now seen corresponding path program 4 times [2018-11-10 04:37:16,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:16,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:16,941 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:16,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 04:37:16,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 04:37:16,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:37:16,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:17,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:17,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 04:37:17,005 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:17,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 4 times [2018-11-10 04:37:17,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:37:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:37:17,071 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. cyclomatic complexity: 17 Second operand 8 states. [2018-11-10 04:37:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:17,104 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-10 04:37:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:37:17,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2018-11-10 04:37:17,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 79 states and 90 transitions. [2018-11-10 04:37:17,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 04:37:17,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 04:37:17,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 90 transitions. [2018-11-10 04:37:17,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:17,107 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-11-10 04:37:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 90 transitions. [2018-11-10 04:37:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-10 04:37:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 04:37:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-11-10 04:37:17,111 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-10 04:37:17,111 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-10 04:37:17,111 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:37:17,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 89 transitions. [2018-11-10 04:37:17,112 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:17,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:17,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,114 INFO L793 eck$LassoCheckResult]: Stem: 1416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1387#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1388#L6-4 assume true; 1418#L6-1 assume !!(init_nondet_~i~0 < 5); 1442#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1441#L7-1 havoc init_nondet_#t~nondet1; 1440#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1419#L6-4 assume true; 1403#L6-1 assume !!(init_nondet_~i~0 < 5); 1375#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1370#L7-1 havoc init_nondet_#t~nondet1; 1371#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1422#L6-4 assume true; 1439#L6-1 assume !!(init_nondet_~i~0 < 5); 1438#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1437#L7-1 havoc init_nondet_#t~nondet1; 1436#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1435#L6-4 assume true; 1434#L6-1 assume !!(init_nondet_~i~0 < 5); 1433#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1432#L7-1 havoc init_nondet_#t~nondet1; 1431#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1430#L6-4 assume true; 1426#L6-1 assume !!(init_nondet_~i~0 < 5); 1429#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1428#L7-1 havoc init_nondet_#t~nondet1; 1427#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1425#L6-4 assume true; 1401#L6-1 assume !(init_nondet_~i~0 < 5); 1402#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1423#L17-4 assume true; 1404#L17-1 [2018-11-10 04:37:17,114 INFO L795 eck$LassoCheckResult]: Loop: 1404#L17-1 assume !!(rangesum_~i~1 < 5); 1379#L18 assume rangesum_~i~1 > 2; 1380#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1409#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1410#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1420#L17-4 assume true; 1404#L17-1 [2018-11-10 04:37:17,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,114 INFO L82 PathProgramCache]: Analyzing trace with hash 191195533, now seen corresponding path program 5 times [2018-11-10 04:37:17,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 5 times [2018-11-10 04:37:17,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash -296951261, now seen corresponding path program 1 times [2018-11-10 04:37:17,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:37:17,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:37:17,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:37:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:37:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:37:17,235 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-10 04:37:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:17,284 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-10 04:37:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:37:17,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 101 transitions. [2018-11-10 04:37:17,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 99 transitions. [2018-11-10 04:37:17,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 04:37:17,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 04:37:17,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 99 transitions. [2018-11-10 04:37:17,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:17,288 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-10 04:37:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 99 transitions. [2018-11-10 04:37:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-10 04:37:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 04:37:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-11-10 04:37:17,294 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-10 04:37:17,294 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-10 04:37:17,294 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 04:37:17,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 96 transitions. [2018-11-10 04:37:17,295 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:17,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:17,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,296 INFO L793 eck$LassoCheckResult]: Stem: 1596#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1565#L6-4 assume true; 1581#L6-1 assume !!(init_nondet_~i~0 < 5); 1551#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1552#L7-1 havoc init_nondet_#t~nondet1; 1626#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1598#L6-4 assume true; 1599#L6-1 assume !!(init_nondet_~i~0 < 5); 1627#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1546#L7-1 havoc init_nondet_#t~nondet1; 1547#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1603#L6-4 assume true; 1625#L6-1 assume !!(init_nondet_~i~0 < 5); 1624#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1623#L7-1 havoc init_nondet_#t~nondet1; 1622#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1621#L6-4 assume true; 1620#L6-1 assume !!(init_nondet_~i~0 < 5); 1619#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1618#L7-1 havoc init_nondet_#t~nondet1; 1617#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1616#L6-4 assume true; 1611#L6-1 assume !!(init_nondet_~i~0 < 5); 1614#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1613#L7-1 havoc init_nondet_#t~nondet1; 1612#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1610#L6-4 assume true; 1579#L6-1 assume !(init_nondet_~i~0 < 5); 1580#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1604#L17-4 assume true; 1584#L17-1 assume !!(rangesum_~i~1 < 5); 1558#L18 assume !(rangesum_~i~1 > 2); 1559#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1615#L17-4 assume true; 1582#L17-1 [2018-11-10 04:37:17,296 INFO L795 eck$LassoCheckResult]: Loop: 1582#L17-1 assume !!(rangesum_~i~1 < 5); 1556#L18 assume rangesum_~i~1 > 2; 1557#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1588#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1589#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1600#L17-4 assume true; 1582#L17-1 [2018-11-10 04:37:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1604772506, now seen corresponding path program 1 times [2018-11-10 04:37:17,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 6 times [2018-11-10 04:37:17,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:17,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1818849476, now seen corresponding path program 1 times [2018-11-10 04:37:17,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:37:17,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:17,371 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:37:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:17,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:37:17,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:17,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 04:37:17,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:37:17,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:37:17,459 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-10 04:37:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:17,499 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-10 04:37:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:37:17,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2018-11-10 04:37:17,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 101 states and 111 transitions. [2018-11-10 04:37:17,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-10 04:37:17,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 04:37:17,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 111 transitions. [2018-11-10 04:37:17,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:17,501 INFO L705 BuchiCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-11-10 04:37:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 111 transitions. [2018-11-10 04:37:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-10 04:37:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 04:37:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-10 04:37:17,504 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-10 04:37:17,504 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-10 04:37:17,504 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 04:37:17,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 108 transitions. [2018-11-10 04:37:17,505 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:17,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:17,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 04:37:17,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,506 INFO L793 eck$LassoCheckResult]: Stem: 1916#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1883#L6-4 assume true; 1918#L6-1 assume !!(init_nondet_~i~0 < 5); 1958#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1957#L7-1 havoc init_nondet_#t~nondet1; 1923#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1919#L6-4 assume true; 1900#L6-1 assume !!(init_nondet_~i~0 < 5); 1873#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1868#L7-1 havoc init_nondet_#t~nondet1; 1869#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1956#L6-4 assume true; 1955#L6-1 assume !!(init_nondet_~i~0 < 5); 1954#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1952#L7-1 havoc init_nondet_#t~nondet1; 1950#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1949#L6-4 assume true; 1948#L6-1 assume !!(init_nondet_~i~0 < 5); 1944#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1943#L7-1 havoc init_nondet_#t~nondet1; 1942#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1941#L6-4 assume true; 1935#L6-1 assume !!(init_nondet_~i~0 < 5); 1939#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1938#L7-1 havoc init_nondet_#t~nondet1; 1937#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1934#L6-4 assume true; 1898#L6-1 assume !(init_nondet_~i~0 < 5); 1899#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1920#L17-4 assume true; 1903#L17-1 assume !!(rangesum_~i~1 < 5); 1904#L18 assume !(rangesum_~i~1 > 2); 1945#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1921#L17-4 assume true; 1922#L17-1 assume !!(rangesum_~i~1 < 5); 1876#L18 assume !(rangesum_~i~1 > 2); 1877#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1940#L17-4 assume true; 1901#L17-1 [2018-11-10 04:37:17,506 INFO L795 eck$LassoCheckResult]: Loop: 1901#L17-1 assume !!(rangesum_~i~1 < 5); 1874#L18 assume rangesum_~i~1 > 2; 1875#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1908#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1909#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1924#L17-4 assume true; 1901#L17-1 [2018-11-10 04:37:17,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1781349567, now seen corresponding path program 2 times [2018-11-10 04:37:17,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 7 times [2018-11-10 04:37:17,524 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash -207484971, now seen corresponding path program 2 times [2018-11-10 04:37:17,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:37:17,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:17,574 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:37:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:37:17,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:37:17,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:37:17,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:37:17,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:37:17,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 04:37:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:37:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:37:17,681 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-10 04:37:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:17,735 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-10 04:37:17,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:37:17,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 124 transitions. [2018-11-10 04:37:17,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-11-10 04:37:17,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 112 states and 122 transitions. [2018-11-10 04:37:17,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 04:37:17,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 04:37:17,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 122 transitions. [2018-11-10 04:37:17,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:17,738 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-11-10 04:37:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 122 transitions. [2018-11-10 04:37:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-10 04:37:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 04:37:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-11-10 04:37:17,742 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-10 04:37:17,742 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-10 04:37:17,742 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 04:37:17,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2018-11-10 04:37:17,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 04:37:17,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:17,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:17,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-11-10 04:37:17,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:17,744 INFO L793 eck$LassoCheckResult]: Stem: 2273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2237#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 2238#L6-4 assume true; 2275#L6-1 assume !!(init_nondet_~i~0 < 5); 2318#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2316#L7-1 havoc init_nondet_#t~nondet1; 2280#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2276#L6-4 assume true; 2257#L6-1 assume !!(init_nondet_~i~0 < 5); 2225#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2220#L7-1 havoc init_nondet_#t~nondet1; 2221#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2314#L6-4 assume true; 2312#L6-1 assume !!(init_nondet_~i~0 < 5); 2311#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2310#L7-1 havoc init_nondet_#t~nondet1; 2309#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2308#L6-4 assume true; 2307#L6-1 assume !!(init_nondet_~i~0 < 5); 2306#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2304#L7-1 havoc init_nondet_#t~nondet1; 2302#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2300#L6-4 assume true; 2293#L6-1 assume !!(init_nondet_~i~0 < 5); 2297#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2296#L7-1 havoc init_nondet_#t~nondet1; 2295#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2292#L6-4 assume true; 2255#L6-1 assume !(init_nondet_~i~0 < 5); 2256#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 2277#L17-4 assume true; 2260#L17-1 assume !!(rangesum_~i~1 < 5); 2231#L18 assume !(rangesum_~i~1 > 2); 2232#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2278#L17-4 assume true; 2279#L17-1 assume !!(rangesum_~i~1 < 5); 2305#L18 assume !(rangesum_~i~1 > 2); 2303#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2301#L17-4 assume true; 2299#L17-1 assume !!(rangesum_~i~1 < 5); 2298#L18 assume !(rangesum_~i~1 > 2); 2284#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2294#L17-4 assume true; 2258#L17-1 [2018-11-10 04:37:17,744 INFO L795 eck$LassoCheckResult]: Loop: 2258#L17-1 assume !!(rangesum_~i~1 < 5); 2229#L18 assume rangesum_~i~1 > 2; 2230#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 2264#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 2265#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2281#L17-4 assume true; 2258#L17-1 [2018-11-10 04:37:17,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash -473954408, now seen corresponding path program 3 times [2018-11-10 04:37:17,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 8 times [2018-11-10 04:37:17,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -107115538, now seen corresponding path program 3 times [2018-11-10 04:37:17,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:18,464 WARN L179 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 130 [2018-11-10 04:37:18,547 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:18,547 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:18,547 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:18,547 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:18,547 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:37:18,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:18,547 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:18,547 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:18,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-10 04:37:18,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:18,547 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:18,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:18,981 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:18,981 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:37:18,981 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-11-10 04:37:18,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:18,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:18,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:18,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:18,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:18,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:18,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:18,986 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-11-10 04:37:18,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:18,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:18,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:18,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:18,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:18,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:18,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:18,991 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-11-10 04:37:18,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:18,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:18,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:18,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:18,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:18,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:18,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:18,996 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-11-10 04:37:18,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:18,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:18,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:18,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:18,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:18,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:19,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:19,000 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-11-10 04:37:19,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:19,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:19,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:19,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:19,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:37:19,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:37:19,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:37:19,030 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:37:19,030 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:37:19,031 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:37:19,031 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:37:19,032 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:37:19,032 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2018-11-10 04:37:19,062 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 04:37:19,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:19,121 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-11-10 04:37:19,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-10 04:37:19,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 120 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 139 states and 155 transitions. Complement of second has 7 states. [2018-11-10 04:37:19,145 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-11-10 04:37:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:37:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 04:37:19,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 43 letters. Loop has 6 letters. [2018-11-10 04:37:19,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 49 letters. Loop has 6 letters. [2018-11-10 04:37:19,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 43 letters. Loop has 12 letters. [2018-11-10 04:37:19,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 155 transitions. [2018-11-10 04:37:19,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 04:37:19,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 113 states and 124 transitions. [2018-11-10 04:37:19,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-10 04:37:19,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2018-11-10 04:37:19,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 124 transitions. [2018-11-10 04:37:19,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:19,152 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-11-10 04:37:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 124 transitions. [2018-11-10 04:37:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-11-10 04:37:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 04:37:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-11-10 04:37:19,156 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-11-10 04:37:19,156 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-11-10 04:37:19,156 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 04:37:19,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 123 transitions. [2018-11-10 04:37:19,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 04:37:19,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:19,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:19,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:19,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 04:37:19,158 INFO L793 eck$LassoCheckResult]: Stem: 2708#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2675#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 2676#L6-4 assume true; 2693#L6-1 assume !!(init_nondet_~i~0 < 5); 2669#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2664#L7-1 havoc init_nondet_#t~nondet1; 2665#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2711#L6-4 assume true; 2712#L6-1 assume !!(init_nondet_~i~0 < 5); 2759#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2757#L7-1 havoc init_nondet_#t~nondet1; 2755#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2753#L6-4 assume true; 2751#L6-1 assume !!(init_nondet_~i~0 < 5); 2748#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2747#L7-1 havoc init_nondet_#t~nondet1; 2746#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2744#L6-4 assume true; 2742#L6-1 assume !!(init_nondet_~i~0 < 5); 2739#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2738#L7-1 havoc init_nondet_#t~nondet1; 2737#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2736#L6-4 assume true; 2728#L6-1 assume !!(init_nondet_~i~0 < 5); 2734#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2732#L7-1 havoc init_nondet_#t~nondet1; 2730#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2727#L6-4 assume true; 2691#L6-1 assume !(init_nondet_~i~0 < 5); 2692#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 2713#L17-4 assume true; 2696#L17-1 assume !!(rangesum_~i~1 < 5); 2670#L18 assume !(rangesum_~i~1 > 2); 2671#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2714#L17-4 assume true; 2715#L17-1 assume !!(rangesum_~i~1 < 5); 2764#L18 assume !(rangesum_~i~1 > 2); 2762#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2761#L17-4 assume true; 2760#L17-1 assume !!(rangesum_~i~1 < 5); 2745#L18 assume !(rangesum_~i~1 > 2); 2743#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2740#L17-4 assume true; 2721#L17-1 assume !(rangesum_~i~1 < 5); 2710#L17-5 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 2690#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 2672#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 2666#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 2661#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 2657#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 2658#L40-4 havoc main_#t~mem6; 2686#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 2682#L40-6 assume { :begin_inline_rangesum } true;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; 2683#L17-10 assume true; 2768#L17-7 assume !!(rangesum_~i~1 < 5); 2659#L18-2 assume !(rangesum_~i~1 > 2); 2660#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2667#L17-10 assume true; 2668#L17-7 assume !!(rangesum_~i~1 < 5); 2705#L18-2 assume !(rangesum_~i~1 > 2); 2767#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2766#L17-10 assume true; 2765#L17-7 assume !!(rangesum_~i~1 < 5); 2720#L18-2 assume !(rangesum_~i~1 > 2); 2698#L17-9 [2018-11-10 04:37:19,158 INFO L795 eck$LassoCheckResult]: Loop: 2698#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2719#L17-10 assume true; 2717#L17-7 assume !!(rangesum_~i~1 < 5); 2718#L18-2 assume !(rangesum_~i~1 > 2); 2698#L17-9 [2018-11-10 04:37:19,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1733386244, now seen corresponding path program 1 times [2018-11-10 04:37:19,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 04:37:19,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:37:19,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:37:19,206 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:19,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 3126234, now seen corresponding path program 1 times [2018-11-10 04:37:19,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:19,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,231 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:19,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:19,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:19,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:19,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:37:19,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:19,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:19,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:19,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration11_Loop [2018-11-10 04:37:19,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:19,232 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:19,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:19,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:19,251 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:19,251 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:19,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:37:19,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:37:19,266 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:37:19,267 INFO L446 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_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:19,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:37:19,290 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:19,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:37:19,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:37:19,408 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:37:19,410 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:37:19,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:37:19,410 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:37:19,410 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:37:19,410 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:37:19,410 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:37:19,410 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:37:19,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:37:19,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration11_Loop [2018-11-10 04:37:19,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:37:19,411 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:37:19,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:37:19,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-11-10 04:37:19,427 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:37:19,427 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:37:19,428 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-11-10 04:37:19,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:19,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:19,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:19,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:19,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:19,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:19,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:19,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:37:19,434 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-11-10 04:37:19,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:37:19,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:37:19,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:37:19,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:37:19,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:37:19,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:37:19,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:37:19,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:37:19,437 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:37:19,437 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:37:19,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:37:19,438 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:37:19,438 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:37:19,438 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2018-11-10 04:37:19,438 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:37:19,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:19,506 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-11-10 04:37:19,506 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 123 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-10 04:37:19,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 123 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 138 states and 152 transitions. Complement of second has 5 states. [2018-11-10 04:37:19,545 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-11-10 04:37:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 04:37:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-10 04:37:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 64 letters. Loop has 4 letters. [2018-11-10 04:37:19,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 68 letters. Loop has 4 letters. [2018-11-10 04:37:19,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 64 letters. Loop has 8 letters. [2018-11-10 04:37:19,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:37:19,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 152 transitions. [2018-11-10 04:37:19,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 04:37:19,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 120 states and 132 transitions. [2018-11-10 04:37:19,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-10 04:37:19,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 04:37:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 132 transitions. [2018-11-10 04:37:19,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:19,550 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-11-10 04:37:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 132 transitions. [2018-11-10 04:37:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-10 04:37:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 04:37:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-11-10 04:37:19,553 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-11-10 04:37:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:37:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:37:19,553 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 4 states. [2018-11-10 04:37:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:19,598 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2018-11-10 04:37:19,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:37:19,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 162 transitions. [2018-11-10 04:37:19,600 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 04:37:19,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 161 transitions. [2018-11-10 04:37:19,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 04:37:19,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 04:37:19,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 161 transitions. [2018-11-10 04:37:19,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:19,602 INFO L705 BuchiCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-10 04:37:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 161 transitions. [2018-11-10 04:37:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2018-11-10 04:37:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-10 04:37:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-11-10 04:37:19,605 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-11-10 04:37:19,605 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-11-10 04:37:19,605 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 04:37:19,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 132 transitions. [2018-11-10 04:37:19,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 04:37:19,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:19,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:19,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:19,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:19,608 INFO L793 eck$LassoCheckResult]: Stem: 3462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 3425#L6-4 assume true; 3444#L6-1 assume !!(init_nondet_~i~0 < 5); 3414#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3407#L7-1 havoc init_nondet_#t~nondet1; 3408#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3465#L6-4 assume true; 3466#L6-1 assume !!(init_nondet_~i~0 < 5); 3502#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3501#L7-1 havoc init_nondet_#t~nondet1; 3500#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3499#L6-4 assume true; 3498#L6-1 assume !!(init_nondet_~i~0 < 5); 3497#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3496#L7-1 havoc init_nondet_#t~nondet1; 3495#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3494#L6-4 assume true; 3493#L6-1 assume !!(init_nondet_~i~0 < 5); 3491#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3489#L7-1 havoc init_nondet_#t~nondet1; 3486#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3485#L6-4 assume true; 3479#L6-1 assume !!(init_nondet_~i~0 < 5); 3482#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3481#L7-1 havoc init_nondet_#t~nondet1; 3480#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3478#L6-4 assume true; 3442#L6-1 assume !(init_nondet_~i~0 < 5); 3443#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 3467#L17-4 assume true; 3468#L17-1 assume !!(rangesum_~i~1 < 5); 3416#L18 assume !(rangesum_~i~1 > 2); 3417#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3469#L17-4 assume true; 3450#L17-1 assume !!(rangesum_~i~1 < 5); 3451#L18 assume !(rangesum_~i~1 > 2); 3513#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3512#L17-4 assume true; 3511#L17-1 assume !!(rangesum_~i~1 < 5); 3492#L18 assume !(rangesum_~i~1 > 2); 3490#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3487#L17-4 assume true; 3448#L17-1 assume !!(rangesum_~i~1 < 5); 3449#L18 assume rangesum_~i~1 > 2; 3457#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 3458#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3476#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3474#L17-4 assume true; 3473#L17-1 assume !(rangesum_~i~1 < 5); 3464#L17-5 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 3441#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3421#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 3415#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3409#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 3399#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 3400#L40-4 havoc main_#t~mem6; 3435#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 3433#L40-6 assume { :begin_inline_rangesum } true;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; 3434#L17-10 assume true; 3477#L17-7 assume !!(rangesum_~i~1 < 5); 3472#L18-2 assume !(rangesum_~i~1 > 2); 3418#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3419#L17-10 assume true; 3504#L17-7 assume !!(rangesum_~i~1 < 5); 3403#L18-2 assume !(rangesum_~i~1 > 2); 3404#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3507#L17-10 assume true; 3506#L17-7 assume !!(rangesum_~i~1 < 5); 3484#L18-2 assume !(rangesum_~i~1 > 2); 3483#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3410#L17-10 assume true; 3411#L17-7 assume !!(rangesum_~i~1 < 5); 3401#L18-2 [2018-11-10 04:37:19,608 INFO L795 eck$LassoCheckResult]: Loop: 3401#L18-2 assume rangesum_~i~1 > 2; 3402#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 3445#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3446#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3471#L17-10 assume true; 3470#L17-7 assume !!(rangesum_~i~1 < 5); 3401#L18-2 [2018-11-10 04:37:19,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 360769887, now seen corresponding path program 1 times [2018-11-10 04:37:19,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:19,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 04:37:19,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:37:19,654 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:37:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 04:37:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:37:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 04:37:19,751 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:37:19,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 1 times [2018-11-10 04:37:19,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:37:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:37:19,790 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-10 04:37:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:19,925 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2018-11-10 04:37:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:37:19,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 202 transitions. [2018-11-10 04:37:19,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2018-11-10 04:37:19,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 184 states and 201 transitions. [2018-11-10 04:37:19,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-10 04:37:19,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 04:37:19,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 201 transitions. [2018-11-10 04:37:19,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:19,928 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 201 transitions. [2018-11-10 04:37:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 201 transitions. [2018-11-10 04:37:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2018-11-10 04:37:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 04:37:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-11-10 04:37:19,931 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-11-10 04:37:19,931 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-11-10 04:37:19,931 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 04:37:19,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 141 transitions. [2018-11-10 04:37:19,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 04:37:19,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:19,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:19,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:19,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:19,934 INFO L793 eck$LassoCheckResult]: Stem: 4008#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 3972#L6-4 assume true; 3990#L6-1 assume !!(init_nondet_~i~0 < 5); 3962#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3955#L7-1 havoc init_nondet_#t~nondet1; 3956#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4011#L6-4 assume true; 4012#L6-1 assume !!(init_nondet_~i~0 < 5); 4056#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4055#L7-1 havoc init_nondet_#t~nondet1; 4054#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4053#L6-4 assume true; 4052#L6-1 assume !!(init_nondet_~i~0 < 5); 4051#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4050#L7-1 havoc init_nondet_#t~nondet1; 4049#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4048#L6-4 assume true; 4047#L6-1 assume !!(init_nondet_~i~0 < 5); 4045#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4042#L7-1 havoc init_nondet_#t~nondet1; 4038#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4037#L6-4 assume true; 4033#L6-1 assume !!(init_nondet_~i~0 < 5); 4036#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4035#L7-1 havoc init_nondet_#t~nondet1; 4034#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4032#L6-4 assume true; 3988#L6-1 assume !(init_nondet_~i~0 < 5); 3989#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 4013#L17-4 assume true; 4014#L17-1 assume !!(rangesum_~i~1 < 5); 4062#L18 assume !(rangesum_~i~1 > 2); 4065#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4063#L17-4 assume true; 4064#L17-1 assume !!(rangesum_~i~1 < 5); 3963#L18 assume !(rangesum_~i~1 > 2); 3964#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4076#L17-4 assume true; 4075#L17-1 assume !!(rangesum_~i~1 < 5); 4060#L18 assume !(rangesum_~i~1 > 2); 4059#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4058#L17-4 assume true; 3994#L17-1 assume !!(rangesum_~i~1 < 5); 3995#L18 assume rangesum_~i~1 > 2; 4057#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4046#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4043#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4039#L17-4 assume true; 4021#L17-1 assume !!(rangesum_~i~1 < 5); 4027#L18 assume rangesum_~i~1 > 2; 4025#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4023#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4022#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4020#L17-4 assume true; 4019#L17-1 assume !(rangesum_~i~1 < 5); 4010#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 3987#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3965#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 3957#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3952#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 3946#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 3947#L40-4 havoc main_#t~mem6; 3981#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 3978#L40-6 assume { :begin_inline_rangesum } true;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; 3979#L17-10 assume true; 4044#L17-7 assume !!(rangesum_~i~1 < 5); 4041#L18-2 assume !(rangesum_~i~1 > 2); 3966#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3967#L17-10 assume true; 4069#L17-7 assume !!(rangesum_~i~1 < 5); 3950#L18-2 assume !(rangesum_~i~1 > 2); 3951#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4077#L17-10 assume true; 4004#L17-7 assume !!(rangesum_~i~1 < 5); 4005#L18-2 assume !(rangesum_~i~1 > 2); 4061#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3958#L17-10 assume true; 3959#L17-7 assume !!(rangesum_~i~1 < 5); 3948#L18-2 assume rangesum_~i~1 > 2; 3949#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 3991#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3992#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4031#L17-10 assume true; 4030#L17-7 assume !!(rangesum_~i~1 < 5); 4018#L18-2 [2018-11-10 04:37:19,934 INFO L795 eck$LassoCheckResult]: Loop: 4018#L18-2 assume rangesum_~i~1 > 2; 4029#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 4028#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4026#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4024#L17-10 assume true; 4017#L17-7 assume !!(rangesum_~i~1 < 5); 4018#L18-2 [2018-11-10 04:37:19,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1820660483, now seen corresponding path program 1 times [2018-11-10 04:37:19,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:19,951 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 04:37:19,951 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 04:37:19,952 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/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-11-10 04:37:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 2 times [2018-11-10 04:37:20,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:20,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:20,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1970112057, now seen corresponding path program 2 times [2018-11-10 04:37:20,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:20,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:20,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:20,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,089 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 04:37:20,089 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 04:37:20,089 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 04:37:20,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 04:37:20,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 04:37:20,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 04:37:20,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:37:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-10 04:37:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:37:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:37:20,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:37:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:37:20,218 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-10 04:37:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:37:20,278 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-11-10 04:37:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:37:20,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 161 transitions. [2018-11-10 04:37:20,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:37:20,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 123 states and 127 transitions. [2018-11-10 04:37:20,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-10 04:37:20,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-10 04:37:20,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 127 transitions. [2018-11-10 04:37:20,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:37:20,282 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-10 04:37:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 127 transitions. [2018-11-10 04:37:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-11-10 04:37:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 04:37:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-10 04:37:20,285 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-10 04:37:20,285 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-10 04:37:20,285 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 04:37:20,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 111 transitions. [2018-11-10 04:37:20,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 04:37:20,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:37:20,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:37:20,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:37:20,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 04:37:20,287 INFO L793 eck$LassoCheckResult]: Stem: 4571#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4542#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 20;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 4543#L6-4 assume true; 4557#L6-1 assume !!(init_nondet_~i~0 < 5); 4526#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4521#L7-1 havoc init_nondet_#t~nondet1; 4522#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4574#L6-4 assume true; 4575#L6-1 assume !!(init_nondet_~i~0 < 5); 4605#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4604#L7-1 havoc init_nondet_#t~nondet1; 4603#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4602#L6-4 assume true; 4601#L6-1 assume !!(init_nondet_~i~0 < 5); 4600#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4599#L7-1 havoc init_nondet_#t~nondet1; 4598#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4597#L6-4 assume true; 4596#L6-1 assume !!(init_nondet_~i~0 < 5); 4595#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4594#L7-1 havoc init_nondet_#t~nondet1; 4593#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4592#L6-4 assume true; 4588#L6-1 assume !!(init_nondet_~i~0 < 5); 4591#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4590#L7-1 havoc init_nondet_#t~nondet1; 4589#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4587#L6-4 assume true; 4555#L6-1 assume !(init_nondet_~i~0 < 5); 4556#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 4576#L17-4 assume true; 4560#L17-1 assume !!(rangesum_~i~1 < 5); 4534#L18 assume !(rangesum_~i~1 > 2); 4535#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4577#L17-4 assume true; 4578#L17-1 assume !!(rangesum_~i~1 < 5); 4621#L18 assume !(rangesum_~i~1 > 2); 4580#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4581#L17-4 assume true; 4618#L17-1 assume !!(rangesum_~i~1 < 5); 4620#L18 assume !(rangesum_~i~1 > 2); 4619#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4617#L17-4 assume true; 4615#L17-1 assume !!(rangesum_~i~1 < 5); 4532#L18 assume rangesum_~i~1 > 2; 4533#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4564#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4565#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4579#L17-4 assume true; 4558#L17-1 assume !!(rangesum_~i~1 < 5); 4559#L18 assume rangesum_~i~1 > 2; 4567#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4568#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4585#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4583#L17-4 assume true; 4582#L17-1 assume !(rangesum_~i~1 < 5); 4573#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4554#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 4536#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 4527#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 4523#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 4515#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 4516#L40-4 havoc main_#t~mem6; 4552#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 4549#L40-6 assume { :begin_inline_rangesum } true;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; 4550#L17-10 assume true; 4609#L17-7 assume !!(rangesum_~i~1 < 5); 4608#L18-2 assume !(rangesum_~i~1 > 2); 4537#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4538#L17-10 assume true; 4616#L17-7 assume !!(rangesum_~i~1 < 5); 4614#L18-2 assume !(rangesum_~i~1 > 2); 4539#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4530#L17-10 assume true; 4531#L17-7 assume !!(rangesum_~i~1 < 5); 4519#L18-2 assume !(rangesum_~i~1 > 2); 4520#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4613#L17-10 assume true; 4612#L17-7 assume !!(rangesum_~i~1 < 5); 4611#L18-2 assume rangesum_~i~1 > 2; 4610#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 4606#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4607#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4528#L17-10 assume true; 4529#L17-7 assume !!(rangesum_~i~1 < 5); 4517#L18-2 assume rangesum_~i~1 > 2; 4518#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 4561#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4562#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4586#L17-10 assume true; 4584#L17-7 assume !(rangesum_~i~1 < 5); 4524#L17-11 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4525#L26-1 main_#t~ret7 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7; 4569#L42 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L42 4540#L42-1 main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 4541#L43-4 [2018-11-10 04:37:20,288 INFO L795 eck$LassoCheckResult]: Loop: 4541#L43-4 assume true; 4544#L43-1 assume !!(main_~i~2 < 4); 4546#L44 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L44 4572#L44-1 SUMMARY for call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L44-1 4570#L44-2 havoc main_#t~mem10; 4566#L43-3 main_#t~post9 := main_~i~2;main_~i~2 := main_#t~post9 + 1;havoc main_#t~post9; 4541#L43-4 [2018-11-10 04:37:20,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1515535766, now seen corresponding path program 1 times [2018-11-10 04:37:20,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:37:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,298 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 04:37:20,298 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 04:37:20,298 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 04:37:20,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -799316151, now seen corresponding path program 1 times [2018-11-10 04:37:20,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:20,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:20,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:37:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 970651378, now seen corresponding path program 1 times [2018-11-10 04:37:20,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:37:20,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:37:20,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:20,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:37:20,423 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 04:37:20,423 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 04:37:20,423 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c616f921-70e0-43e7-a469-56b3c043aca8/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 04:37:20,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:37:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:23,657 WARN L179 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 364 DAG size of output: 286 [2018-11-10 04:38:44,911 WARN L179 SmtUtils]: Spent 1.16 m on a formula simplification. DAG size of input: 1338 DAG size of output: 169 [2018-11-10 04:38:44,913 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:38:44,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:38:44,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:38:44,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:38:44,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:38:44,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:38:44,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:38:44,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:38:44,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-10 04:38:44,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:38:44,914 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:38:44,916 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 04:38:44,934 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 6056 disjunctions. This might take some time... [2018-11-10 04:38:45,120 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 143 disjunctions. [2018-11-10 04:38:45,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:38:45,295 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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) 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-11-10 04:38:45,297 INFO L168 Benchmark]: Toolchain (without parser) took 91617.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.5 MB). Free memory was 963.0 MB in the beginning and 1.3 GB in the end (delta: -311.7 MB). Peak memory consumption was 938.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:45,298 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:38:45,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.23 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:45,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:45,299 INFO L168 Benchmark]: Boogie Preprocessor took 21.41 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:38:45,299 INFO L168 Benchmark]: RCFGBuilder took 504.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:45,300 INFO L168 Benchmark]: BuchiAutomizer took 90843.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.3 MB). Peak memory consumption was 946.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:38:45,303 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.23 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.41 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 504.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 90843.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -168.3 MB). Peak memory consumption was 946.9 MB. Max. memory is 11.5 GB. * 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...